Nonclassical polynomials as a barrier to polynomial lower bounds.
Abhishek BhowmickShachar LovettPublished in: Electron. Colloquium Comput. Complex. (2014)
Keyphrases
- lower bound
- low order
- upper bound
- algebraic geometry
- lagrange interpolation
- algebraic curves
- piecewise polynomial
- orthogonal polynomials
- branch and bound
- np hard
- receptive fields
- branch and bound algorithm
- average case complexity
- implicit polynomial
- higher order
- lower and upper bounds
- lower bounding
- special case
- upper and lower bounds
- invariant representations
- polynomial equations
- linear programming relaxation
- worst case
- optimal solution
- equivalence queries
- average case
- objective function
- vc dimension
- high order
- object recognition