Login / Signup
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
Michael Alekhnovich
Edward A. Hirsch
Dmitry Itsykson
Published in:
Electron. Colloquium Comput. Complex. (2004)
Keyphrases
</>
lower bound
learning algorithm
running times
np complete
orders of magnitude
max sat
computational complexity
upper bound
theoretical analysis
worst case
sat instances
image registration
branch and bound algorithm
upper and lower bounds
propositional satisfiability
random instances