The rank ofn×nmatrix multiplication is at least3n2-22n32-3n-Reference-Cited by-同舟云学术

The rank ofn×nmatrix multiplication is at least3n2-22n32-3n

Published:2013-06 Issue:11 Volume:438 Page:4500-4509
ISSN:0024-3795
Container-title:Linear Algebra and its Applications
language:en
Short-container-title:Linear Algebra and its Applications

Author:

Massarenti Alex,Raviolo Emanuele

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory

Reference6 articles.

1. M. Bläser, A 52n2 lower bound for the rank of n×n-matrix multiplication over arbitrary fields, in: 440th Annual Symposium on Foundations of Computer Science (New York, 1999), IEEE Computer Soc., Los Alamitos, CA, 1999, pp. 45–50 (MR MR1916183).

2. J.M. Landsberg, New lower bounds for the rank of matrix multiplication, arXiv:1206.1530.

3. Tensors: Geometry and Applications;Landsberg,2012

4. J.M. Landsberg, G. Ottaviani, New lower bounds for the border rank of matrix multiplication, arXiv:1112.6007.

5. Gaussian elimination is not optimal;Strassen;Numer. Math.,1969

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decomposition Algorithms for Tensors and Polynomials;SIAM Journal on Applied Algebra and Geometry;2023-03-31

2. On secant dimensions and identifiability of flag varieties;Journal of Pure and Applied Algebra;2022-06

3. On secant defectiveness and identifiability of Segre–Veronese varieties;Revista Matemática Iberoamericana;2022-04-05

4. An Introduction to the Computational Complexity of Matrix Multiplication;Journal of the Operations Research Society of China;2019-12-05

5. On Comon’s and Strassen’s Conjectures;Mathematics;2018-10-25