A Lower Bound for Polynomial Multiplication.
Michael KaminskiPublished in: Theor. Comput. Sci. (1985)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- floating point
- np hard
- worst case
- polynomial approximation
- average case complexity
- low order
- lower and upper bounds
- upper and lower bounds
- lower bounding
- sufficiently accurate
- optimal solution
- database
- arithmetic operations
- constant factor approximation algorithm
- statistical queries
- online algorithms
- sample complexity
- machine learning
- data sets