On the algorithmic complexity of associative algebras |
| |
Authors: | A. Alder V. Strassen |
| |
Affiliation: | Seminar für Angewandte Mathematik, Universität Zürich, CH-8032 Zürich, Switzerland |
| |
Abstract: | The complexity L(A) of a finite dimensional associative algebra A is the number of non-scalar multiplications/divisions of an optimal algorithm to compute the product of two elements of the algebra. We show , where t is the number of maximal two-sided ideals of A. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|