Login / Signup
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.
Michael Alekhnovich
Edward A. Hirsch
Dmitry Itsykson
Published in:
J. Autom. Reason. (2005)
Keyphrases
</>
lower bound
upper bound
worst case
max sat
computational complexity
theoretical analysis
learning algorithm
objective function
optimization problems
lower and upper bounds
data structure
online learning
decision problems
combinatorial optimization