Fetching the paper…
Reading the bibliography…
In the past few years, successive improvements of the asymptotic complexity of square matrix multiplication have been obtained by developing novel methods to analyze the powers of the Coppersmith-Winograd tensor, a basic construction introduced thirty years ago.
Gaussian elimination is not optimal
Volker Strassen · 1969
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 rectangular matrix multiplication
Grazia Lotti and Francesco Romani · 1983
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.
Algebraic complexity theory
Peter Bürgisser, Michael Clausen, and Mohammad Amin Shokrollahi · 1997
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
Earlier work this paper cites.
All pairs lightest shortest paths
Uri Zwick · 1999
Earlier work this paper cites.
Fully dynamic transitive closure: Breaking through the o ( n 2 ) o(n^{2}) barrier
Camil Demetrescu and Giuseppe F. Italiano · 2000
Earlier work this paper cites.
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Uri Zwick · 2002
Cited alongside, same era.
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
Raphael Yuster and Uri Zwick · 2004
Cited alongside, same era.
Fast sparse matrix multiplication
Raphael Yuster and Uri Zwick · 2005
Cited alongside, same era.
Colored intersection searching via sparse rectangular matrix multiplication
Haim Kaplan, Micha Sharir, and Elad Verbin · 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
Noga Alon and Raphael Yuster · 2007
Cited alongside, same era.
Counting colors in boxes
Haim Kaplan, Natan Rubin, Micha Sharir, and Elad Verbin · 2007
All-pairs shortest paths with a sublinear additive error
Liam Roditty and Asaf Shapira · 2011
Later among the works it cites.
Non-uniform ACC circuit lower bounds
Ryan Williams · 2011
Later among the works it cites.
Faster algorithms for rectangular matrix multiplication
François Le Gall · 2012
Later among the works it cites.
Multiplying matrices faster than Coppersmith-Winograd
Virginia Vassilevska Williams · 2012
Later among the works it cites.
Fast matrix multiplication
Markus Bläser · 2013
Later among the works it cites.
Improved bound for complexity of matrix multiplication
Alexander Munro Davie and Andrew James Stothers · 2013
Later among the works it cites.
Powers of tensors and fast matrix multiplication
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Fast rectangular matrix multiplication and some applications
ShanXue Ke, BenSheng Zeng, WenBao Han, and Victor Y. Pan · 2008
Cited alongside, same era.
Faster join-projects and sparse matrix multiplications
Rasmus Resen Amossen and Rasmus Pagh · 2009
Cited alongside, same era.
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
Raphael Yuster · 2009
Cited alongside, same era.
On the possibility of faster SAT algorithms
Mihai Patrascu and Ryan Williams · 2010
Cited alongside, same era.
Fast dynamic transitive closure with lookahead
Piotr Sankowski and Marcin Mucha · 2010
Cited alongside, same era.
On the Complexity of Matrix Multiplication
Andrew Stothers · 2010
Cited alongside, same era.
François Le Gall · 2014
Later among the works it cites.
If the current clique algorithms are optimal, so is Valiant’s parser
Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams · 2015
Later among the works it cites.
Fast matrix multiplication: Limitations of the Coppersmith-Winograd method
Andris Ambainis, Yuval Filmus, and François Le Gall · 2015
Later among the works it cites.
Finding four-node subgraphs in triangle time
Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, and Huacheng Yu · 2015
Later among the works it cites.
Truly sub-cubic 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 · 2016
Later among the works it cites.