Phase Transition in a Random Fragmentation Problem with Applications to Computer Science
David S. DeanSatya N. MajumdarPublished in: CoRR (2002)
Keyphrases
- phase transition
- random instances
- computer science
- random constraint satisfaction problems
- randomly generated
- easy hard easy pattern
- constraint satisfaction
- lecture notes
- satisfiability problem
- np complete
- random sat
- combinatorial problems
- graph coloring
- artificial intelligence
- average degree
- sat problem
- lower bound
- hard problems
- np complete problems
- relational learning
- deep structure
- data mining
- random graphs
- hamiltonian cycle
- stochastic local search
- constraint satisfaction problems
- upper bound