Constructing an asymptotic phase transition in random binary constraint satisfaction problems.
Barbara M. SmithPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- phase transition
- random instances
- randomly generated
- random constraint satisfaction problems
- easy hard easy pattern
- constraint satisfaction
- satisfiability problem
- combinatorial problems
- hard problems
- graph coloring
- np complete
- random sat
- average degree
- constraint satisfaction problems
- random graphs
- hamiltonian cycle
- search algorithm
- stochastic local search
- np complete problems
- deep structure
- relational learning
- sat problem
- lower bound
- boolean satisfiability
- cellular automata
- evolutionary algorithm