Please note PRISM will be upgraded March 27-28 to make the submission process better for you! No new content can be added during this time. We apologize for the inconvenience.
A LOWER BOUND FOR THE MULTIPLICATION OF POLYNOMIALS MODULO A POLYNOMIAL
| dc.contributor.author | Bshouty, Nader H. | eng |
| dc.date.accessioned | 2008-02-27T16:48:58Z | |
| dc.date.available | 2008-02-27T16:48:58Z | |
| dc.date.issued | 1991-06-01 | eng |
| dc.identifier.uri | http://hdl.handle.net/1880/45742 | |
| dc.description.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$. | eng |
| dc.language.iso | Eng | eng |
| dc.subject | Computer Science | eng |
| dc.title | A LOWER BOUND FOR THE MULTIPLICATION OF POLYNOMIALS MODULO A POLYNOMIAL | eng |
| dc.type | unknown | |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.description.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 | eng |
| dc.identifier.department | 1991-433-17 | eng |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30472 | |
| thesis.degree.discipline | Computer Science | eng |
