New Results on the Phase Transition for Random Quantified Boolean Formulas.
Nadia CreignouHervé DaudéUwe EglyRaphaël RossignolPublished in: SAT (2008)
Keyphrases
- phase transition
- quantified boolean formulas
- random instances
- random constraint satisfaction problems
- randomly generated
- constraint satisfaction
- easy hard easy pattern
- np complete
- satisfiability problem
- sat problem
- propositional satisfiability
- decision procedures
- constraint satisfaction problems
- lower bound
- reasoning tasks
- random sat
- stochastic local search
- cellular automata
- sat instances
- boolean formula
- learning algorithm
- relational learning
- davis putnam
- state space
- search algorithm