Fast matrix multiplication using coherent configurations

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

R. Salem and D. C. Spencer · 1942

Earlier work this paper cites.

Gaussian elimination is not optimal

V. Strassen · 1969

Earlier work this paper cites.

Coherent configurations I

D. G. Higman · 1970

Earlier work this paper cites.

Combinatorial considerations about permutation groups

D. G. Higman · 1972

Earlier work this paper cites.

Coherent configurations I. Ordinary representation theory

D. G. Higman · 1975

Earlier work this paper cites.

O ⁡ ( n 2.7799 ) O(n^{2.7799}) complexity for matrix multiplication

D. Bini, M. Capovani, G. Lotti, and F. Romani · 1979

Earlier work this paper cites.

Relations between exact and approximate bilinear algorithms. Applications

D. Bini · 1980

Earlier work this paper cites.

Partial and total matrix multiplication

A. Schönhage · 1981

Cited alongside, same era.

Relative bilinear complexity and matrix multiplication

V. Strassen · 1987

Cited alongside, same era.

Matrix multiplication via arithmetic progressions

D. Coppersmith and S. Winograd · 1990

Cited alongside, same era.

Tensor rank is NP-Complete

J. Håstad · 1990

Cited alongside, same era.

Algebraic Complexity Theory

P. Bürgisser, M. Clausen, and M. A. Shokrollahi · 1997

Cited alongside, same era.

Permutation Groups

P. J. Cameron · 1999

Cited alongside, same era.

Improved bound for complexity of matrix multiplication

A. M. Davie and A. J. Stothers

A group-theoretic approach to fast matrix multiplication

H. Cohn and C. Umans · 2003

Later among the works it cites.

Group-theoretic algorithms for matrix multiplication

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

Later among the works it cites.

Complexity of bilinear algorithms (course notes taken by F. Bendun)

M. Bläser · 2009

Later among the works it cites.

On the complexity of matrix multiplication

A. Stothers · 2010

Later among the works it cites.

On sunflowers and matrix multiplication

N. Alon, A. Shpilka, and C. Umans · 2012

Closest in time.

Multiplying matrices faster than Coppersmith-Winograd

V. Vassilevska Williams · 2012

Closest in time.