Semisimple algebras of almost minimal rank over the reals

DOI10.1016/j.tcs.2009.08.022zbMath1194.68121OpenAlexW2121876881MaRDI QIDQ1034526

Andreas Meyer de Voltaire, Markus Bläser

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.022

zbMATH Keywords

algebras of minimal rankassociative algebrasbilinear complexity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Finite-dimensional division rings (16K20) Computational aspects of associative rings (general theory) (16Z05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Commutative algebras of minimal rank
• On a class of primary algebras of minimal rank
• On the algorithmic complexity of associative algebras
• Multiplicative complexity of direct sums of quadratic systems
• On the complexity of the multiplication of matrices of small formats
• Characterization of Division Algebras of Minimal Rank and the Structure of their Algorithm Varieties
• On the complexity of some algorithms of matrix multiplication
• A Complete Characterization of the Algebras of Minimal Bilinear Complexity
• Lower bounds for the bilinear complexity of associative algebras

This page was built for publication: Semisimple algebras of almost minimal rank over the reals