Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers.
Titus DosePublished in: Electron. Colloquium Comput. Complex. (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- search space
- computational problems
- arc consistency
- non binary
- np complete
- constraint solving
- combinatorial problems
- np hard
- space complexity
- worst case
- constraint networks
- computational complexity
- decomposition methods
- pseudo boolean optimization
- solving constraint satisfaction problems
- constraint optimization
- finite domain
- constraint problems
- global constraints
- sat problem
- temporal constraints
- disjunctive temporal
- soft constraints
- forward checking
- constraint graph
- backtracking search
- partial constraint satisfaction
- phase transition