Even Delta-Matroids and the Complexity of Planar Boolean CSPs
From MaRDI portal
Publication:4575757
DOI10.1137/1.9781611974782.20zbMath1410.68170OpenAlexW2949835687MaRDI QIDQ4575757
Vladimir Kolmogorov, Michal Rolínek, Alexandr Kazda
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.20
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (3)
On planar valued CSPs ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ On the Complexity of Holant Problems
This page was built for publication: Even Delta-Matroids and the Complexity of Planar Boolean CSPs