Even Delta-Matroids and the Complexity of Planar Boolean CSPs

DSpace Repository

Even Delta-Matroids and the Complexity of Planar Boolean CSPs

Author: Kazda, Alexandr; Kolmogorov, Vladimir; Rolinek, Michal
Tübinger Autor(en):

Rolinek, Michal
Published in: Acm Transactions on Algorithms (2019), Bd. 15, Article 22
Verlagsangabe: Assoc Computing Machinery
Language: English
Full text: http://dx.doi.org/10.1145/3230649
ISSN: 1549-6333
DDC Classifikation: 004 - Data processing and computer science
510 - Mathematics
Dokumentart: Artikel
Show full item record

This item appears in the following Collection(s)