Abstract
In Theoretical Computer Science (1983), Lempel, Seroussi and Winograd
proved the lower bound left ( 2~+~1 over {q~-~1} right )~n~-~o(n)
for the multiplicative complexity of the multiplication of two polynomials of
degree $n~-~1$ modulo an \fBirreducible\fR polynomial $p$ of degree $n$ over
a finite field $F$ with $q$ elements.
In this paper we prove this lower bound holds for Bany polynomial $p$
of degree $n$.
Notes
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca
