ON THE ALGORITHMIC COMPLEXITY OF ASSOCIATIVE ALGEBRAS OVER FINITE FIELDS
Date
1990-05-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Computer Science