Login / Signup

An upper bound for the circuit complexity of existentially quantified Boolean formulas.

Hans Kleine BüningAnja Remshagen
Published in: Theor. Comput. Sci. (2010)
Keyphrases
  • upper bound
  • worst case
  • quantified boolean formulas
  • lower bound
  • branch and bound algorithm
  • computational complexity
  • branch and bound
  • special case
  • artificial intelligence
  • np hard
  • orders of magnitude