Login / Signup
Even Delta-Matroids and the Complexity of Planar Boolean CSPs.
Alexandr Kazda
Vladimir Kolmogorov
Michal Rolínek
Published in:
ACM Trans. Algorithms (2019)
Keyphrases
</>
constraint satisfaction problems
constraint satisfaction
computational complexity
worst case
information retrieval
computational cost
real valued
boolean functions
constraint networks
non binary
independent set