A new upper bound for 3-SAT
Josep DíazLefteris M. KirousisDieter MitscheXavier Pérez-GiménezPublished in: CoRR (2008)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- boolean satisfiability
- sat solvers
- worst case
- max sat
- satisfiability problem
- branch and bound
- upper and lower bounds
- phase transition
- stochastic local search
- generalization error
- sat problem
- sat solving
- lower and upper bounds
- variable ordering
- search algorithm
- propositional satisfiability
- stochastic local search algorithms
- sat instances
- search strategies
- learning algorithm
- sat encodings
- neural network