Login / Signup
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms
Evgeny Dantsin
Edward A. Hirsch
Alexander Wolpert
Published in:
Electron. Colloquium Comput. Complex. (2005)
Keyphrases
</>
upper bound
worst case
search space
upper and lower bounds
learning algorithm
orders of magnitude
search strategies
data structure
computational cost
computational complexity
significant improvement
exhaustive search
pruning algorithms
lower bound
black box