Improved bound for complexity of matrix multiplication
Alexander M. Davie, Andrew James Stothers · Proceedings of the Royal Society of Edinburgh Section A Mathematics · 2013
We give a new bound ω < 2.37369 for the exponent of complexity of matrix multiplication, giving a small improvement on the previous bound obtained by Coppersmith and Winograd. The proof involves an extension of the method used by these authors. We have attempted to make the exposition self-contained.