Subexponential Time Complexity of CSP with Global Constraints.
Ronald de HaanIyad A. KanjStefan SzeiderPublished in: CP (2014)
Keyphrases
- global constraints
- constraint satisfaction problems
- constraint programming
- arc consistency
- weighted constraint satisfaction
- space complexity
- constraint satisfaction
- combinatorial problems
- boolean constraints
- parameterized complexity
- fixed parameter tractable
- integer linear programming
- constraint networks
- symmetry breaking
- constraint propagation
- non binary
- boltzmann machine
- np hard
- genetic algorithm
- np complete
- computational complexity
- special case
- worst case