A sharp threshold for a random constraint satisfaction problem.
Abraham FlaxmanPublished in: Discret. Math. (2004)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- random instances
- constraint propagation
- constraint programming
- search space
- np complete
- constraint solving
- partial constraint satisfaction
- non binary
- finite domain
- binary csps
- hard constraints
- soft constraints
- decomposition methods
- forward checking
- pseudo boolean optimization
- product configuration
- sat problem
- constraint networks
- arc consistency
- temporal constraints
- np hard
- global constraints
- randomly generated
- constraint problems
- constraint graph
- finding optimal solutions
- tractable subclasses
- disjunctive temporal