Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems.
Tomoyuki YamakamiPublished in: COCOON (2011)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- np complete
- constraint propagation
- constraint programming
- arc consistency
- search space
- constraint solving
- combinatorial problems
- soft constraints
- np hard
- computational problems
- global constraints
- constraint networks
- sat problem
- non binary
- space complexity
- constraint optimization
- worst case
- forward checking
- backtracking search
- finding optimal solutions
- disjunctive temporal