Recognizing more random unsatisfiable 3-SAT instances efficiently.
Andreas GoerdtAndré LankaPublished in: Electron. Notes Discret. Math. (2003)
Keyphrases
- sat solvers
- sat instances
- phase transition
- random sat
- random instances
- easy hard easy pattern
- randomly generated
- satisfiability problem
- sat problem
- random sat instances
- orders of magnitude
- search space
- constraint satisfaction
- propositional satisfiability
- objective function
- max sat
- stochastic local search
- decision makers