A Complete Characterization of the Algebras of Minimal Bilinear Complexity
From MaRDI portal
Publication:4651535
DOI10.1137/S0097539703438277zbMath1087.68037MaRDI QIDQ4651535
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of associative rings (general theory) (16Z05)
Related Items (4)
A note on the gap between rank and border rank ⋮ Classification of subspaces in \(\mathbb F^2\otimes \mathbb F^3\) and orbits in \(\mathbb F^2 \otimes \mathbb F^3 \otimes \mathbb F^r\) ⋮ Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication ⋮ Semisimple algebras of almost minimal rank over the reals
This page was built for publication: A Complete Characterization of the Algebras of Minimal Bilinear Complexity
