Multiplicative complexity of polynomial multiplication over finite fields

Authors:
Michael Kaminski;Nader H. Bshouty
Affiliations:
-;-
Venue:
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Year:
1987

Citing 5
Cited 0

A lower bound for polynomial multiplication

Theoretical Computer Science
Algebras Having Linear Multiplicative Complexities

Journal of the ACM (JACM)
Computations of Bilinear Forms over Finite Fields

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
An Improved Lower Bound on Polynomial Multiplication

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let Mq(n) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q-element field by means of bilinear algorithms. It is shown that Mq(n) ≥ 3n - o(n). In particular, if q/2