Corrigendum to ``The rank of nn matrix multiplication is at least 3n^2 - 22n^32 - 3n

DOI10.1016/J.LAA.2013.12.009MaRDI QIDQ2442299zbMATH OpenOpenAlexFDO

Authors 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 theorymatrix multiplicationtensors

Mathematics Subject Classification ID

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

Recommendations

• Corrigendum to: ``Decompositions of matrices over division algebras into products of commutators
• Corrigendum to ``Ranks of elliptic curves
• Corrections and additions to: "principal components of minusm-matrices"
• The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)
• Corrigendum to: ``Expressing infinite matrices over rings as products of involutions

Cites work

• New lower bounds for the rank of matrix multiplication
• The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)

Cited in

(12)

• On Comon's and Strassen's conjectures
• Correction to: ``An approximate augmented Lagrangian method for nonnegative low-rank matrix approximation
• Corrigendum to: ``Decompositions of matrices over division algebras into products of commutators
• Fast matrix multiplication and its algebraic neighbourhood
• On non-commutative rank and tensor rank
• Lower bound for ranks of invariant forms
• Corrigendum to: ``Determinants of normalized Bohemian upper Hessenberg matrices
• Corrigendum to: ``The Gerstenhaber problem for commuting triples of matrices is `decidable'
• Corrigendum to: ``Trees and \(n\)-good hypergraphs
• Corrigendum: On a problem of Lang for matrix polynomials
• Publisher correction to: ``An algorithm for the non-identifiability of rank-3 tensors
• Corrigendum to: ``Oriented transformations on a finite chain: another description

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\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442299)