ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS OVER FINITE FIELDS
dc.contributor.author | Bshouty, Nader H. | eng |
dc.date.accessioned | 2008-02-27T16:48:48Z | |
dc.date.available | 2008-02-27T16:48:48Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1990-05-01 | eng |
dc.description.abstract | The multiplicative complexity of a finite dimensional associative algebra A over a finite field BF is the number of nonscalar multiplication needed to multiply two elements of the algebra A. In this paper we generalize all the results known from the literature about lower bounds for the multiplicative complexity of associative algebras over finite fields. | 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 | 1990-386-10 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30483 | |
dc.identifier.uri | http://hdl.handle.net/1880/45740 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS OVER FINITE FIELDS | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |