Fetching the paper…
Reading the bibliography…
The complexity of matrix multiplication is measured in terms of $\omega$, the smallest real number such that two $n\times n$ matrices can be multiplied using $O(n^{\omega+\epsilon})$ field operations for all $\epsilon>0$; the best bound until now is $\omega<2.37287$ [Le Gall'14].
“On sets of integers which contain no three terms in arithmetical progression”
Raphaël Salem and Donald. Spencer · 1942
Earlier work this paper cites.
“On sets of integers which contain no three terms in arithmetical progression”
Felix. Behrend · 1946
Earlier work this paper cites.
“Gaussian elimination is not optimal”
Volker Strassen · 1969
Earlier work this paper cites.
“Strassen’s Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix Operations”
Victor. Pan · 1978
Earlier work this paper cites.
“ O ( n 2.7799 ) {O}(n^{2.7799}) Complexity for n × n n\times n Approximate Matrix Multiplication”
Dario Bini, Milvio Capovani, Francesco Romani and Grazia Lotti · 1979
Earlier work this paper cites.
“Border rank of a p × q × 2 p\times q\times 2 tensor and the optimal approximation of a pair of bilinear forms”
Dario Bini · 1980
Earlier work this paper cites.
“New Fast Algorithms for Matrix Operations”
Victor. Pan · 1980
Earlier work this paper cites.
“Partial and Total Matrix Multiplication”
Arnold Schönhage · 1981
Earlier work this paper cites.
“On the Asymptotic Complexity of Matrix Multiplication”
Don Coppersmith and Shmuel Winograd · 1982
Earlier work this paper cites.
“Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication”
Francesco Romani · 1982
Earlier work this paper cites.
“Rank and optimal computation of generic tensors”
Volker Strassen · 1983
Earlier work this paper cites.
“A note on border rank”
Thomas Lickteig · 1984
Earlier work this paper cites.
“The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication”
Volker Strassen · 1986
Earlier work this paper cites.
“Relative bilinear complexity and matrix multiplication”
Volker Strassen · 1987
Earlier work this paper cites.
“Matrix multiplication via arithmetic progressions”
Don Coppersmith and Shmuel Winograd · 1990
Earlier work this paper cites.
“A 5/2 n 2 {}^{\mbox{2}} -Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields”
Markus Blaser · 1999
Earlier work this paper cites.
“A group-theoretic approach to fast matrix multiplication”
Henry Cohn and Christopher Umans · 2003
Earlier work this paper cites.
“On the Complexity of Matrix Product”
Ran Raz · 2003
Cited alongside, same era.
“Lower bounds for matrix product”
Amir Shpilka · 2003
Cited alongside, same era.
“Group-theoretic algorithms for matrix multiplication”
Henry Cohn, Robert Kleinberg, Balazs Szegedy and Christopher Umans · 2005
Cited alongside, same era.
“Graph implementations for nonsmooth convex programs” http://stanford.edu/~boyd/graph_dcp.html
Michael Grant and Stephen Boyd · 2008
Cited alongside, same era.
“Geometric complexity theory and tensor rank”
Peter Bürgisser and Christian Ikenmeyer · 2011
Cited alongside, same era.
“Multiplying matrices faster than Coppersmith-Winograd”
Virginia Vassilevska Williams · 2012
Cited alongside, same era.
“Which groups are amenable to proving exponent two for matrix multiplication?”
Jonah Blasiak, Thomas Church, Henry Cohn, Joshua. Grochow and Chris Umans · 2017
Later among the works it cites.
“Further limitations of the known approaches for matrix multiplication”
Josh Alman and Virginia Vassilevska Williams · 2018
Later among the works it cites.
“Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor”
Francois Gall and Florent Urrutia · 2018
Later among the works it cites.
“The growth rate of tri-colored sum-free sets”
Robert Kleinberg, Will Sawin and David Speyer · 2018
Later among the works it cites.
“A 2 n 2 − log 2 ( n ) − 1 2n^{2}-\log_{2}(n)-1 lower bound for the border rank of matrix multiplication”
Joseph. Landsberg and Mateusz Michałek · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“On sunflowers and matrix multiplication”
Noga Alon, Amir Shpilka and Christopher Umans · 2013
Cited alongside, same era.
“Fast Matrix Multiplication.”
Markus Bläser · 2013
Cited alongside, same era.
“Algebraic complexity theory”
Peter Bürgisser, Michael Clausen and Mohammad. Shokrollahi · 2013
Cited alongside, same era.
“Fast matrix multiplication using coherent configurations”
Henry Cohn and Christopher Umans · 2013
Cited alongside, same era.
“Improved bound for complexity of matrix multiplication”
Alexander. Davie and Andrew. Stothers · 2013
Cited alongside, same era.
“CVX: Matlab Software for Disciplined Convex Programming, version 2.1”, http://cvxr.com/cvx , 2014
Michael Grant and Stephen Boyd · 2014
Cited alongside, same era.
“Maple 2018”, Maplesoft, a division of Waterloo Maple Inc., Waterloo, Ontario, 2018
2018
Later among the works it cites.
“MATLAB 9.6 (R2019a)”, The MathWorks Inc., Natick, Massachusetts, 2019
2019
Later among the works it cites.
“Slice rank of block tensors and irreversibility of structure tensors of algebras”
Markus Bläser and Vladimir Lysikov · 2020
Closest in time.
“Limits on the Universal Method for Matrix Multiplication”
Josh Alman · 2021
Closest in time.
“A Refined Laser Method and Faster Matrix Multiplication”
Josh Alman and Virginia Williams · 2021
Closest in time.
“Barriers for Fast Matrix Multiplication from Irreversibility”
Matthias Christandl, Péter Vrana and Jeroen Zuiddam · 2021
Closest in time.
“Verification code for the numerical value bounds”, http://code.joshalman.com/MM , 2021
2021
Closest in time.
“Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication”
Josh Alman and Virginia Vassilevska Williams · 2023
Closest in time.
“Matrix Multiplication via Matrix Groups”
Jonah Blasiak, Henry Cohn, Joshua Grochow, Kevin Pratt and Chris Umans · 2023
Closest in time.
“Faster matrix multiplication via asymmetric hashing”
Ran Duan, Hongxun Wu and Renfei Zhou · 2023
Closest in time.
“Irreversibility of structure tensors of modules”
Maciej Wojtala · 2023
Closest in time.
“New bounds for matrix multiplication: from alpha to omega”
Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu and Renfei Zhou · 2024
Closest in time.