Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45740
Title: ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS OVER FINITE FIELDS
Authors: Bshouty, Nader H.
Keywords: Computer Science
Issue Date: 1-May-1990
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.
URI: http://hdl.handle.net/1880/45740
Appears in Collections:Bshouty, Nader

Files in This Item:
File Description SizeFormat 
1990-386-10.pdf1.56 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.