Title :
An Improved Lower Bound on Polynomial Multiplication
Author :
Brown, Mark R. ; Dobkin, David P.
Author_Institution :
Department of Computer Science, Yale University
fDate :
5/1/1980 12:00:00 AM
Abstract :
We prove an asymptotic lower bound of 3.52n nonscalar multiplications for (degree n – 1 by degree n – 1) polynomial multiplication in a model which allows only integers as scalars. Index Terms-Algebraic complexity, lower bound, polynomial multiplication.
Keywords :
Binary codes; Computational modeling; Costs; Information rates; Matrix decomposition; Performance evaluation; Polynomials; Tensile stress; Vectors;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1980.1675583
