Phase transition thresholds for some Friedman-style independence results.
Andreas WeiermannPublished in: Math. Log. Q. (2007)
Keyphrases
- phase transition
- constraint satisfaction
- randomly generated
- satisfiability problem
- hard problems
- np complete
- combinatorial problems
- graph coloring
- random constraint satisfaction problems
- sat problem
- cellular automata
- average degree
- random instances
- deep structure
- hamiltonian cycle
- combinatorial optimization
- constraint satisfaction problems
- reinforcement learning