Even Delta-Matroids and the Complexity of Planar Boolean CSPs

DOI10.1145/3230649zbMath1436.68139arXiv1602.03124OpenAlexW2904289608MaRDI QIDQ4629990

Vladimir Kolmogorov, Alexandr Kazda, Michal Rolínek

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.03124

zbMATH Keywords

constraint satisfaction problemdelta-matroidblossom algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Computational aspects of satisfiability (68R07)

This page was built for publication: Even Delta-Matroids and the Complexity of Planar Boolean CSPs