Login / Signup
Even Delta-Matroids and the Complexity of Planar Boolean CSPs.
Alexandr Kazda
Vladimir Kolmogorov
Michal Rolínek
Published in:
CoRR (2016)
Keyphrases
</>
constraint satisfaction problems
real valued
search space
computational complexity
computational cost
upper bound
worst case
constraint satisfaction
decision problems
constraint propagation
space complexity