Fetching the paper…
Reading the bibliography…
Duan, Wu and Zhou (FOCS 2023) recently obtained the improved upper bound on the exponent of square matrix multiplication $\omega<2.3719$ by introducing a new approach to quantify and compensate the ``combination loss" in prior analyses of powers of the Coppersmith-Winograd tensor.
Gaussian elimination is not optimal
Volker Strassen · 1969
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.
Field extension and triangular aggregating, uniting and canceling for the acceleration of matrix multiplications
Victor Y. Pan · 1979
Earlier work this paper cites.
New combinations of methods for the acceleration of matrix multiplication
Victor Y. Pan · 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.
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.
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
Cited alongside, same era.
All pairs lightest shortest paths
Uri Zwick · 1999
Cited alongside, same era.
Fully dynamic transitive closure: Breaking through the o ( n 2 ) o(n^{2}) barrier
Camil Demetrescu and Giuseppe F. Italiano · 2000
Cited alongside, same era.
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 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
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
François Le Gall · 2014
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.
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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Fast rectangular matrix multiplication and some applications
ShanXue Ke, BenSheng Zeng, WenBao Han, and Victor Y. Pan · 2008
Cited alongside, same era.
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
Raphael Yuster · 2009
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.
All-pairs shortest paths with a sublinear additive error
Liam Roditty and Asaf Shapira · 2011
Cited alongside, same era.
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.
Barriers for rectangular matrix multiplication
Matthias Christandl, François Le Gall, Vladimir Lysikov, and Jeroen Zuiddam · 2020
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
Later among the works it cites.
Maple 2022. Maplesoft, a division of Waterloo Maple Inc., Waterloo, Ontario
2022
Later among the works it cites.
Faster matrix multiplication via asymmetric hashing
Ran Duan, Hongxun Wu, and Renfei Zhou · 2023
Closest in time.