Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR14-154 | 20th November 2014 04:16

Fast Matrix Multiplication: Limitations of the Laser Method

TR14-154
Authors: Andris Ambainis, Yuval Filmus, Francois Le Gall
Publication: 20th November 2014 04:20
Until a few years ago, the fastest known matrix multiplication algorithm, due to Coppersmith and Winograd (1990), ran in time $O(n^{2.3755})$. Recently, a surge of activity by Stothers, Vassilevska-Williams, and Le Gall has led to an improved algorithm running in time $O(n^{2.3729})$. These algorithms are obtained by analyzing higher and higher tensor powers of a certain identity of Coppersmith and Winograd. We show that this exact approach cannot result in an algorithm with running time $O(n^{2.3725})$, and identify a wide class of variants of this approach which cannot result in an algorithm with running time $O(n^{2.3078})$; in particular, this approach cannot prove the conjecture that for every $\epsilon > 0$, two $n\times n$ matrices can be multiplied in time $O(n^{2+\epsilon})$.