Locating the Phase Transition in Binary Constraint Satisfaction Problems.
Barbara M. SmithMartin E. DyerPublished in: Artif. Intell. (1996)
Keyphrases
- phase transition
- constraint satisfaction
- satisfiability problem
- np complete
- randomly generated
- hard problems
- combinatorial problems
- graph coloring
- random instances
- magnetic field
- average degree
- relational learning
- sat problem
- deep structure
- np complete problems
- cellular automata
- random constraint satisfaction problems
- stochastic local search
- boolean satisfiability
- special case
- random graphs
- constraint programming
- small world networks
- random walk