An Improved Lower Bound on Polynomial Multiplication

Authors:
M. R. Brown;D. P. Dobkin
Affiliations:
Department of Computer Science, Yale University;-
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 0
Cited 3

Multiplicative complexity of polynomial multiplication over finite fields

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Arithmetic Circuits: A survey of recent results and open questions

Foundations and Trends® in Theoretical Computer Science
A lower bound on the complexity of polynomial multiplication over finite fields

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	14.98

Visualization

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.