Please use this identifier to cite or link to this item:
|Title:||ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS OVER FINITE FIELDS|
|Authors:||Bshouty, Nader H.|
|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.|
|Appears in Collections:||Bshouty, Nader |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.