An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial.
Michael KaminskiChaoping XingPublished in: IEEE Trans. Inf. Theory (2013)
Keyphrases
- upper bound
- worst case
- lower bound
- low order
- average case complexity
- lagrange interpolation
- space complexity
- computational cost
- exponential size
- polynomial hierarchy
- vapnik chervonenkis dimension
- branch and bound algorithm
- algebraic curves
- power consumption
- upper and lower bounds
- algebraic geometry
- computational complexity
- higher order
- generalization error
- arithmetic operations