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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.