Recognizing More Unsatisfiable Random k-SAT Instances Efficiently.
Joel FriedmanAndreas GoerdtMichael KrivelevichPublished in: SIAM J. Comput. (2005)
Keyphrases
- sat solvers
- sat instances
- phase transition
- random sat
- random instances
- randomly generated
- easy hard easy pattern
- sat problem
- random sat instances
- satisfiability problem
- propositional satisfiability
- boolean satisfiability
- orders of magnitude
- search strategies
- database
- boolean formula
- stochastic local search
- search space
- propositional formulas
- special case
- data structure
- objective function
- dynamic programming
- knowledge representation