The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications.
Gabriel IstratePublished in: SODA (1999)
Keyphrases
- phase transition
- random instances
- random sat
- random constraint satisfaction problems
- randomly generated
- random sat instances
- satisfiability problem
- constraint satisfaction
- np complete
- sat problem
- np hard
- easy hard easy pattern
- combinatorial problems
- graph coloring
- hard problems
- relational learning
- np complete problems
- random graphs
- stochastic local search
- cellular automata
- constraint satisfaction problems
- average degree
- propositional logic
- special case
- heuristic search
- dynamic programming
- hamiltonian cycle
- small world networks
- boolean satisfiability
- sat instances
- lower bound
- boolean functions