Locating phase transitions in computationally hard problems
B. AshokT. K. PatraPublished in: CoRR (2010)
Keyphrases
- phase transition
- computationally hard problems
- stochastic local search
- satisfiability problem
- constraint satisfaction
- random constraint satisfaction problems
- randomly generated
- hard problems
- np complete
- combinatorial problems
- sat problem
- deep structure
- random instances
- np complete problems
- random graphs
- graph coloring
- cellular automata
- boolean satisfiability
- objective function
- random sat
- evolutionary algorithm
- optimal solution