A new upper bound for 3-SAT.
Josep DíazLefteris M. KirousisDieter MitscheXavier Pérez-GiménezPublished in: FSTTCS (2008)
Keyphrases
- upper bound
- lower bound
- branch and bound algorithm
- sat solvers
- boolean satisfiability
- max sat
- sat problem
- satisfiability problem
- upper and lower bounds
- search algorithm
- lower and upper bounds
- branch and bound
- sat solving
- error probability
- worst case
- propositional satisfiability
- variable ordering
- stochastic local search algorithms
- phase transition
- temporal logic
- generalization error
- heuristic search
- search strategies
- randomly generated
- search space
- data sets
- pseudo boolean constraints