Author:
Davie A. M.,Stothers A. J.
Abstract
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.
Publisher
Cambridge University Press (CUP)
Cited by
90 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献