The Hardest Constraint Problems: A Double Phase Transition.
Tad HoggColin P. WilliamsPublished in: Artif. Intell. (1994)
Keyphrases
- phase transition
- constraint problems
- constraint satisfaction
- randomly generated
- constraint satisfaction problems
- satisfiability problem
- combinatorial problems
- constraint programming
- np complete
- random instances
- hard problems
- sat problem
- constraint propagation
- soft constraints
- graph coloring
- np complete problems
- heuristic search
- random graphs
- random constraint satisfaction problems
- arc consistency
- optimisation problems
- sat instances
- search space
- cellular automata
- scheduling problem