Lower bounds for algebraic complexity of nilpotent associative algebras |
| |
Authors: | A. V. Leont’ev |
| |
Affiliation: | 1.Institute of Program Systems of the Russian Academy of Sciences,Moscow,Russia |
| |
Abstract: | Exact algebraic algorithms for calculating the product of two elements of nilpotent associative algebras over fields of characteristic zero are considered (this is a particular case of simultaneous calculation of several multinomials). The complexity of an algebra in this computational model is defined as the number of nonscalar multiplications of an optimal algorithm. Lower bounds for the tensor rank of nilpotent associative algebras (in terms of dimensions of certain subalgebras) are obtained, which give lower bounds for the algebraic complexity of this class of algebras. Examples of reaching these estimates for different dimensions of nilpotent algebras are presented. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|