More Asymmetry Yields Faster Matrix Multiplication

On sets of integers which contain no three terms in arithmetical progression

Raphaël Salem and Donald C. Spencer · 1942

Earlier work this paper cites.

On sets of integers which contain no three terms in arithmetical progression

Felix A. 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 Y. 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.

Partial and total matrix multiplication

Arnold Schönhage · 1981

Earlier work this paper cites.

Rapid multiplication of rectangular matrices

Don Coppersmith · 1982

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.

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.

Rectangular matrix multiplication revisited

Don Coppersmith · 1997

Earlier work this paper cites.

All pairs shortest paths using bridging sets and rectangular matrix multiplication

Uri Zwick · 2002

Cited alongside, same era.

SNOPT: An SQP algorithm for large-scale constrained optimization

Philip E. Gill, Walter Murray, and Michael A. Saunders · 2005

Cited alongside, same era.

Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Artur Czumaj, Miroslaw Kowaluk, and Andrzej Lingas · 2007

Cited alongside, same era.

All-pairs bottleneck paths in vertex weighted graphs

Asaf Shapira, Raphael Yuster, and Uri Zwick · 2011

Cited alongside, same era.

Faster algorithms for rectangular matrix multiplication

François Le Gall · 2012

Cited alongside, same era.

Multiplying matrices faster than Coppersmith-Winograd

Virginia Vassilevska Williams · 2012

Cited alongside, same era.

Further limitations of the known approaches for matrix multiplication

Josh Alman and Virginia Vassilevska Williams · 2018

Later among the works it cites.

Limits on all known (and some unknown) approaches to 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

François Le Gall and Florent Urrutia · 2018

Later among the works it cites.

Limits on the universal method for matrix multiplication

Josh Alman · 2021

Later among the works it cites.

A refined laser method and faster matrix multiplication

Josh Alman and Virginia Vassilevska Williams · 2021

Later among the works it cites.

Barriers for fast matrix multiplication from irreversibility

Matthias Christandl, Péter Vrana, and Jeroen Zuiddam · 2021