Login / Signup

Lower Bounds for Computation with Limited Nondeterminism.

Hartmut Klauck
Published in: Computational Complexity Conference (1998)
Keyphrases
  • lower bound
  • upper bound
  • objective function
  • branch and bound
  • situation calculus
  • np hard
  • database management systems
  • branch and bound algorithm
  • efficient computation
  • linear programming relaxation
  • lower bounding