Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions.
Andreas WeiermannPublished in: CiE (2006)
Keyphrases
- phase transition
- satisfiability problem
- constraint satisfaction
- np complete
- combinatorial problems
- random instances
- hard problems
- randomly generated
- random constraint satisfaction problems
- graph coloring
- hamiltonian cycle
- relational learning
- average degree
- sat problem
- random graphs
- np complete problems
- reinforcement learning
- simulated annealing
- evolutionary algorithm