Sharp thresholds for constraint satisfaction problems and homomorphisms.
Hamed HatamiMichael MolloyPublished in: Random Struct. Algorithms (2008)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- search space
- np complete
- arc consistency
- combinatorial problems
- np hard
- non binary
- computational problems
- product configuration
- finite domain
- decomposition methods
- constraint networks
- global constraints
- graph theory
- soft constraints
- temporal constraints
- constraint solving
- backtracking search
- pseudo boolean optimization
- reasoning problems
- random instances
- forward checking
- tractable classes
- sat problem
- solving constraint satisfaction problems
- disjunctive temporal
- heuristic search