Login / Signup

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.

Michael AlekhnovichEdward A. HirschDmitry Itsykson
Published in: ICALP (2004)
Keyphrases
  • lower bound
  • learning algorithm
  • upper bound
  • optimization problems
  • theoretical analysis
  • orders of magnitude
  • np complete
  • first order logic
  • combinatorial optimization
  • lower and upper bounds