Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication

DOI10.1007/978-3-642-20877-5_2zbMath1330.68122OpenAlexW1535855565MaRDI QIDQ3010380

Alexey Pospelov

Publication date: 1 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_2

zbMATH Keywords

group algebraslower boundsbilinear complexitycomplexity of matrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Upgrading Subgroup Triple-Product-Property Triples

Cites Work

• On the algorithmic complexity of associative algebras
• The complexity of group algebra computations
• On the complexity of the multiplication of matrices of small formats
• A Complete Characterization of the Algebras of Minimal Bilinear Complexity
• Algebraic complexities and algebraic curves over finite fields
• Lower bounds for the bilinear complexity of associative algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication