Computing unsatisfiable k-SAT instances with few occurrences per variable.
Shlomo HooryStefan SzeiderPublished in: Theor. Comput. Sci. (2005)
Keyphrases
- sat solvers
- sat instances
- phase transition
- boolean formula
- satisfiability problem
- sat problem
- boolean satisfiability
- constraint satisfaction
- random sat
- max sat
- orders of magnitude
- randomly generated
- pattern matching
- propositional satisfiability
- search strategies
- random instances
- search tree
- stochastic local search
- search space
- search methods
- np complete