Universal Algebra and Hardness Results for Constraint Satisfaction Problems.
Benoît LarosePascal TessonPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- constraint satisfaction problems
- np complete
- constraint satisfaction
- np hard
- random instances
- phase transition
- constraint propagation
- constraint programming
- combinatorial problems
- constraint solving
- non binary
- relational algebra
- search space
- arc consistency
- randomly generated
- forward checking
- decomposition methods
- computational complexity
- query language
- data model
- sat problem
- computational problems
- constraint networks
- reasoning problems
- symmetry breaking
- interval algebra
- constraint optimization
- graph coloring problems
- dynamic constraint satisfaction problems
- real numbers
- special case
- finite domain
- search algorithm
- tractable classes