Corrigendum to ``The rank of \(n{\times}n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)

DOI10.1016/j.laa.2013.12.009zbMath1284.68302OpenAlexW2577623060MaRDI QIDQ2442299

Alex Massarenti, Emanuele Raviolo

Publication date: 2 April 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2013.12.009

zbMATH Keywords

complexity theorytensorsmatrix multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items (4)

On Comon's and Strassen's conjectures ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Lower bound for ranks of invariant forms ⋮ On non-commutative rank and tensor rank

Cites Work

• The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
• New Lower Bounds for the Rank of Matrix Multiplication

This page was built for publication: Corrigendum to ``The rank of \(n{\times}n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)