Improved bound for complexity of matrix multiplication

By A. Davie, A. J. Stothers. Proceedings of the Royal Society of Edinburgh. Section A Mathematics, 2013

157 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Algebraic complexity theory and matrix multiplication (2014, background): “Our presentation of this concept follows [9].”
Solving linear programs in the current matrix multiplication time (2018, methodology): “Despite the exact approach used in [CW87, Wil12, DS13, LG14] cannot give a bound on ω better than 2 .”
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems (2014, background): “373 is the matrix multiplication exponent [36], [15], [10], [11].”
Multiplying matrices in O(n 2:373 ) time (2014, background): “(More recently, a journal paper by Davie and Stothers provides a more detailed account of Stothers’ work [11]).”
A Refined Laser Method and Faster Matrix Multiplication (2020, methodology): “This is not an issue when analyzing smaller powers of CW q as in [CW90, DS13], since there the tensors and partitions are small enough that the linear system deﬁning D α has full rank.”