Nonclassical Polynomials as a Barrier to Polynomial Lower Bounds.
Abhishek BhowmickShachar LovettPublished in: Computational Complexity Conference (2015)
Keyphrases
- lower bound
- low order
- algebraic geometry
- upper bound
- lagrange interpolation
- algebraic curves
- orthogonal polynomials
- piecewise polynomial
- receptive fields
- branch and bound
- branch and bound algorithm
- objective function
- implicit polynomial
- high order
- lower and upper bounds
- average case complexity
- np hard
- optimal solution
- biologically inspired
- upper and lower bounds
- vc dimension
- sample size
- statistical queries
- optimal cost
- polynomial equations
- invariant representations
- higher order
- special case
- data structure
- learning algorithm
- learning theory