The complexity of the counting constraint satisfaction problem.
Andrei A. BulatovPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- arc consistency
- constraint solving
- np complete
- search space
- non binary
- computational complexity
- np hard
- space complexity
- global constraints
- tractable subclasses
- constraint graph
- finite domain
- constraint problems
- decomposition methods
- forward checking
- constraint networks
- partial constraint satisfaction
- lower bound
- hard constraints
- random instances
- configuration problems
- distributed constraint satisfaction problems