An Improved Lower Bound on Polynomial Multiplication
Brown, Dobkin · IEEE Transactions on Computers · 1980
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.