Lower bounds for the bilinear complexity of associative algebras

DOI10.1007/PL00001605zbMath0970.68069OpenAlexW2089740961MaRDI QIDQ5930150

Markus Bläser

Publication date: 17 April 2001

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00001605

zbMATH Keywords

algebras of minimal ranksemisimple algebras of minimal rank

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects of associative rings (general theory) (16Z05)

Related Items (6)

A note on the gap between rank and border rank ⋮ On the complexity of the multiplication of matrices of small formats ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication ⋮ Beyond the Alder-Strassen bound. ⋮ Semisimple algebras of almost minimal rank over the reals

This page was built for publication: Lower bounds for the bilinear complexity of associative algebras