ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS OVER FINITE FIELDS

Simple item page
dc.contributor.authorBshouty, Nader H.eng
dc.date.accessioned2008-02-27T16:48:48Z
dc.date.available2008-02-27T16:48:48Z
dc.date.computerscience1999-05-27eng
dc.date.issued1990-05-01eng
dc.description.abstractThe 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.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.department1990-386-10eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30483
dc.identifier.urihttp://hdl.handle.net/1880/45740
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS OVER FINITE FIELDSeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1990-386-10.pdf
Size:
1.52 MB
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