Sharp thresholds for the phase transition between primitive recursive and Ackermannian Ramsey numbers.
Menachem KojmanGyesik LeeEran OmriAndreas WeiermannPublished in: J. Comb. Theory, Ser. A (2008)
Keyphrases
- phase transition
- constraint satisfaction
- satisfiability problem
- randomly generated
- np complete
- combinatorial problems
- graph coloring
- hard problems
- stochastic local search
- average degree
- hamiltonian cycle
- cellular automata
- random constraint satisfaction problems
- random instances
- np complete problems
- sat problem
- relational learning
- random graphs
- deep structure
- magnetic field