Multiplicative Complexity and Algebraic Structure
作者:
Highlights:
•
摘要
The classical structure theory of an (associative unitary) algebra A over a field F is invoked to determine upper bounds on the (bilinear) multiplicative complexity π(A) of A over F. The upper bound problem for matrix multiplication over a finite extension F of the rational numbers is related to the multiplicative complexity problem for a certain twisted polynomial algebra. For certain base fields F (including finite extensions of the rationals and the real and complex fields) the order of complexity of an F-algebra with all nilpotent ideals having square zero is shown to be bounded above by the complexity of multiplying matrices over F.
论文关键词:
论文评审过程:Revised 3 July 1982, Available online 2 December 2003.
论文官网地址:https://doi.org/10.1016/0022-0000(83)90023-5