Lower bounds for the bilinear complexity of associative algebras
From MaRDI portal
Publication:5930150
DOI10.1007/PL00001605zbMath0970.68069MaRDI QIDQ5930150
Publication date: 17 April 2001
Published in: Computational Complexity (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
16Z05: Computational aspects of associative rings (general theory)
Related Items
Fast matrix multiplication and its algebraic neighbourhood, Semisimple algebras of almost minimal rank over the reals, On the complexity of the multiplication of matrices of small formats, Beyond the Alder-Strassen bound., A note on the gap between rank and border rank, Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication