A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields.
Michael KaminskiPublished in: SIAM J. Comput. (2005)
Keyphrases
- lower bound
- average case complexity
- worst case
- upper bound
- exponential size
- computer vision
- optimal solution
- np hard
- branch and bound algorithm
- branch and bound
- complexity analysis
- objective function
- floating point
- average case
- genetic algorithm
- decision problems
- lower and upper bounds
- dynamic programming
- lower bounding
- polynomial hierarchy
- polynomial approximation
- artificial intelligence