Login / Signup

Lower Bounds for Polynomial Calculus: Non-Binomial Case.

Michael AlekhnovichAlexander A. Razborov
Published in: FOCS (2001)
Keyphrases
  • lower bound
  • np hard
  • objective function
  • upper bound
  • branch and bound algorithm
  • neural network
  • computational complexity
  • image registration
  • branch and bound
  • vc dimension
  • online algorithms