A time lower bound for satisfiability.
Dieter van MelkebeekRan RazPublished in: Theor. Comput. Sci. (2005)
Keyphrases
- lower bound
- upper bound
- satisfiability problem
- branch and bound algorithm
- branch and bound
- optimal solution
- lower and upper bounds
- np complete
- objective function
- propositional logic
- np hard
- worst case
- sufficiently accurate
- lower bounding
- upper and lower bounds
- computational complexity
- phase transition
- sat problem
- terminological reasoning
- computational properties
- lagrangian relaxation
- multi step
- sample complexity
- competitive ratio
- constant factor
- sat encodings
- quantified boolean formulas
- special case
- satisfiability testing
- search algorithm