An extremely sharp phase transition threshold for the slow growing hierarchy.
Andreas WeiermannPublished in: Math. Struct. Comput. Sci. (2006)
Keyphrases
- phase transition
- constraint satisfaction
- satisfiability problem
- hard problems
- np complete
- randomly generated
- random constraint satisfaction problems
- combinatorial problems
- average degree
- random instances
- relational learning
- graph coloring
- np complete problems
- hamiltonian cycle
- deep structure
- cellular automata
- sat problem
- similarity measure
- magnetic field
- random graphs
- stochastic local search