Faster Matrix Multiplication via Asymmetric Hashing

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

R. Salem and D. C. Spencer · 1942

Earlier work this paper cites.

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

F. A. Behrend · 1946

Earlier work this paper cites.

Gaussian elimination is not optimal

V. Strassen · 1969

Earlier work this paper cites.

The Design and Analysis of Computer Algorithms

Alfred V. Aho and John E. Hopcroft · 1974

Earlier work this paper cites.

Triangular factorization and inversion by fast matrix multiplication

James R. Bunch and John E. Hopcroft · 1974

Earlier work this paper cites.

General context-free recognition in less than cubic time

Leslie G. Valiant · 1975

Earlier work this paper cites.

Strassen’s algorithm is not optimal: trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

V. Ya. Pan · 1978

Earlier work this paper cites.

O ( n 2.7799 ) (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.

On the asymptotic complexity of matrix multiplication

D. Coppersmith and S. Winograd · 1981

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.

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.

Matrix multiplication via arithmetic progressions

Don Coppersmith and Shmuel Winograd · 1990

Earlier work this paper cites.

On the all-pairs-shortest-path problem in unweighted undirected graphs

R. Seidel · 1995

Earlier work this paper cites.

Rectangular matrix multiplication revisited

Don Coppersmith · 1997

Earlier work this paper cites.

Fast rectangular matrix multiplication and applications

Xiaohan Huang and Victor Y Pan · 1998

Cited alongside, same era.

All pairs shortest paths using bridging sets and rectangular matrix multiplication

Uri Zwick · 2002

Cited alongside, same era.

A group-theoretic approach to fast matrix multiplication

H. Cohn and C. Umans · 2003

Cited alongside, same era.

Group-theoretic algorithms for matrix multiplication

H. Cohn, R. Kleinberg, B. Szegedy, and C. Umans · 2005

Cited alongside, same era.

Graph implementations for nonsmooth convex programs

Michael Grant and Stephen Boyd · 2008

Cited alongside, same era.

Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths

Ran Duan and Seth Pettie · 2009

Cited alongside, same era.

On cap sets and the group-theoretic approach to matrix multiplication

Jonah Blasiak, Thomas Church, Henry Cohn, Joshua Grochow, and Chris Umans · 2016

Later among the works it cites.

Which groups are amenable to proving exponent two for matrix multiplication?, 2017

Original

Jonah Blasiak, Thomas Church, Henry Cohn, Joshua A. 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

François Le Gall and Florent Urrutia · 2018

Later among the works it cites.

Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product

Karl Bringmann, Fabrizio Grandoni, Barna Saha, and Virginia Vassilevska Williams · 2019

Later among the works it cites.