An Exponential Lower Bound for Width-Restricted Clause Learning.
Jan JohannsenPublished in: SAT (2009)
Keyphrases
- lower bound
- clause learning
- upper bound
- sat solvers
- branch and bound algorithm
- lower and upper bounds
- np hard
- branch and bound
- objective function
- worst case
- optimal solution
- sat solving
- max sat
- genetic algorithm
- sufficiently accurate
- sat problem
- satisfiability problem
- search strategies
- propositional satisfiability
- orders of magnitude
- linear programming
- information retrieval