Issue No. 05 - May (1980 vol. 29)
M.R. Brown , Department of Computer Science, Yale University
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.
D. Dobkin and M. Brown, "An Improved Lower Bound on Polynomial Multiplication," in IEEE Transactions on Computers, vol. 29, no. , pp. 337-340, 1980.