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. ACM Transactions on Algorithms, 15(2), 2019. [doi]

Authors

Alexandr Kazda

This author has not been identified. Look up 'Alexandr Kazda' in Google

Vladimir Kolmogorov

This author has not been identified. Look up 'Vladimir Kolmogorov' in Google

Michal Rolínek

This author has not been identified. Look up 'Michal Rolínek' in Google