首页 | 本学科首页   官方微博 | 高级检索  
     


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
L(A) ? 2ddim A?t
, where t is the number of maximal two-sided ideals of A.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号