Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable.
Shlomo HooryStefan SzeiderPublished in: SAT (2004)
Keyphrases
- sat solvers
- sat instances
- phase transition
- boolean formula
- sat problem
- orders of magnitude
- satisfiability problem
- boolean satisfiability
- randomly generated
- constraint satisfaction
- random sat
- search tree
- stochastic local search
- max sat
- information retrieval
- search strategies
- search space
- random instances
- pattern matching
- np complete