Phase Transition Results for Three Ramsey-Like Theorems.
Florian PelupessyPublished in: Notre Dame J. Formal Log. (2016)
Keyphrases
- phase transition
- satisfiability problem
- constraint satisfaction
- combinatorial problems
- hard problems
- randomly generated
- random instances
- np complete
- cellular automata
- relational learning
- hamiltonian cycle
- average degree
- graph coloring
- deep structure
- random constraint satisfaction problems
- np complete problems
- random graphs
- sat problem
- random sat
- magnetic field
- dynamic programming