Nonclassical polynomials as a barrier to polynomial lower bounds.
Abhishek BhowmickShachar LovettPublished in: CoRR (2014)
Keyphrases
- lower bound
- low order
- lagrange interpolation
- upper bound
- algebraic geometry
- algebraic curves
- orthogonal polynomials
- piecewise polynomial
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- average case complexity
- objective function
- lower bounding
- np hard
- receptive fields
- quadratic assignment problem
- worst case
- implicit polynomial
- high order
- higher order
- upper and lower bounds
- vc dimension
- linear programming relaxation
- curve fitting
- optimal cost
- min sum
- object recognition