The complexity of the counting constraint satisfaction problem.
Andrei A. BulatovPublished in: J. ACM (2013)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- search space
- non binary
- constraint solving
- global constraints
- computational complexity
- arc consistency
- product configuration
- finite domain
- partial constraint satisfaction
- decomposition methods
- pseudo boolean optimization
- np hard
- constraint networks
- decision problems
- constraint solver
- hard constraints
- tractable subclasses
- forward checking
- constraint problems
- worst case
- tractable classes
- graph based representations