Even Delta-Matroids and the Complexity of Planar Boolean CSPs

Alexandr Kazda, Vladimir Kolmogorov, Michal RolĂ­nek. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 307-326, SIAM, 2017. [doi]

Abstract

Abstract is missing.