A LOWER BOUND FOR THE MULTIPLICATION OF POLYNOMIALS MODULO A POLYNOMIAL

Simple item page
dc.contributor.authorBshouty, Nader H.eng
dc.date.accessioned2008-02-27T16:48:58Z
dc.date.available2008-02-27T16:48:58Z
dc.date.computerscience1999-05-27eng
dc.date.issued1991-06-01eng
dc.description.abstractIn 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$.eng
dc.description.notesWe 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.caeng
dc.identifier.department1991-433-17eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30472
dc.identifier.urihttp://hdl.handle.net/1880/45742
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleA LOWER BOUND FOR THE MULTIPLICATION OF POLYNOMIALS MODULO A POLYNOMIALeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1991-433-17.pdf
Size:
790.4 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications