Fetching the paper…
Reading the bibliography…
Let {\alpha} be the maximal value such that the product of an n x n^{\alpha} matrix by an n^{\alpha} x n matrix can be computed with n^{2+o(1)} arithmetic operations.
On sets of integers which contain no three terms in arithmetical progression
Salem, R., and Spencer, D. C · 1942
Earlier work this paper cites.
On sets of integers which contain no three terms in arithmetical progression
Behrend, F. A · 1946
Earlier work this paper cites.
Partial and total matrix multiplication
Schönhage, A · 1981
Earlier work this paper cites.
Rapid multiplication of rectangular matrices
Coppersmith, D · 1982
Earlier work this paper cites.
On the asymptotic complexity of rectangular matrix multiplication
Lotti, G., and Romani, F · 1983
Earlier work this paper cites.
The asymptotic spectrum of tensors and the exponent of matrix multiplication
Strassen, V · 1986
Earlier work this paper cites.
Relative bilinear complexity and matrix multiplication
Strassen, V · 1987
Earlier work this paper cites.
Matrix multiplication via arithmetic progressions
Coppersmith, D., and Winograd, S · 1990
Earlier work this paper cites.
Algebraic complexity theory
Bürgisser, P., Clausen, M., and Shokrollahi, M. A · 1997
Earlier work this paper cites.
Rectangular matrix multiplication revisited
Coppersmith, D · 1997
Earlier work this paper cites.
Fast rectangular matrix multiplication and applications
Huang, X., and Pan, V. Y · 1998
Earlier work this paper cites.
All pairs lightest shortest paths
Zwick, U · 1999
Earlier work this paper cites.
Fully dynamic transitive closure: Breaking through the o ( n 2 ) o(n^{2}) barrier
Demetrescu, C., and Italiano, G. F · 2000
Cited alongside, same era.
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Zwick, U · 2002
Cited alongside, same era.
A group-theoretic approach to fast matrix multiplication
Cohn, H., and Umans, C · 2003
Cited alongside, same era.
Dynamic transitive closure via dynamic matrix inverse (extended abstract)
Sankowski, P · 2004
Cited alongside, same era.
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
Yuster, R., and Zwick, U · 2004
Cited alongside, same era.
Group-theoretic algorithms for matrix multiplication
Cohn, H., Kleinberg, R. D., Szegedy, B., and Umans, C · 2005
Fast rectangular matrix multiplication and some applications
Ke, S., Zeng, B., Han, W., and Pan, V. Y · 2008
Later among the works it cites.
Faster join-projects and sparse matrix multiplications
Amossen, R. R., and Pagh, R · 2009
Later among the works it cites.
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
Yuster, R · 2009
Later among the works it cites.
On the possibility of faster SAT algorithms
Patrascu, M., and Williams, R · 2010
Later among the works it cites.
Fast dynamic transitive closure with lookahead
Sankowski, P., and Mucha, M · 2010
Later among the works it cites.
On the Complexity of Matrix Multiplication
Stothers, A · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fast sparse matrix multiplication
Yuster, R., and Zwick, U · 2005
Cited alongside, same era.
Colored intersection searching via sparse rectangular matrix multiplication
Kaplan, H., Sharir, M., and Verbin, E · 2006
Cited alongside, same era.
Fast algorithms for maximum subset matching and all-pairs shortest paths in graphs with a (not so) small vertex cover
Alon, N., and Yuster, R · 2007
Cited alongside, same era.
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Czumaj, A., Kowaluk, M., and Lingas, A · 2007
Cited alongside, same era.
Counting colors in boxes
Kaplan, H., Rubin, N., Sharir, M., and Verbin, E · 2007
Cited alongside, same era.
Yuster, R · 2010
Later among the works it cites.
All-pairs shortest paths with a sublinear additive error
Roditty, L., and Shapira, A · 2011
Later among the works it cites.
Non-uniform ACC circuit lower bounds
Williams, R · 2011
Later among the works it cites.
On sunflowers and matrix multiplication
Alon, N., Shpilka, A., and Umans, C · 2012
Closest in time.
Multiplying matrices faster than Coppersmith-Winograd
Vassilevska Williams, V · 2012
Closest in time.