"Even Delta-Matroids and the Complexity of Planar Boolean CSPs."

Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek (2019)

> Home

Details and statistics

DOI: 10.1145/3230649

access: closed

type: Journal Article

metadata version: 2019-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/KazdaKR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/KazdaKR19
Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. ACM Trans. Algorithms 15(2): 22:1-22:33 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.