The phase transition in random Horn satisfiability and its algorithmic implications
Gabriel IstratePublished in: CoRR (1999)
Keyphrases
- phase transition
- random instances
- random constraint satisfaction problems
- random sat
- satisfiability problem
- randomly generated
- random sat instances
- constraint satisfaction
- sat problem
- easy hard easy pattern
- stochastic local search
- combinatorial problems
- graph coloring
- np hard
- hard problems
- np complete problems
- np complete
- hamiltonian cycle
- cellular automata
- lower bound
- relational learning
- propositional logic
- sat instances
- random graphs
- average degree
- boolean satisfiability
- davis putnam
- dynamic programming