Login / Signup
An Effective Dichotomy for the Counting Constraint Satisfaction Problem.
Martin E. Dyer
David Richerby
Published in:
SIAM J. Comput. (2013)
Keyphrases
</>
constraint satisfaction problems
constraint satisfaction
search space
non binary
constraint solving
np complete
constraint propagation
arc consistency
constraint programming
constraint networks
tree decompositions
tractable subclasses
np hard
hard constraints