Login / Signup

Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases.

Ruiwen Chen
Published in: MFCS (2) (2015)
Keyphrases
  • lower bound
  • worst case
  • objective function
  • upper bound
  • learning algorithm
  • data structure
  • np hard
  • np complete
  • orders of magnitude