Coppersmith–Winograd algorithm: Difference between revisions

Revision as of 02:44, 28 June 2014

Revision as of 21:48, 14 August 2014

Line 9:

However, unlike the Strassen algorithm, it is not used in practice because it only provides an advantage for matrices so large that they cannot be processed by modern hardware.<ref>{{Citation | last1=Robinson | first1=Sara | title=Toward an Optimal Algorithm for Matrix Multiplication | url=http://www.siam.org/pdf/news/174.pdf | year=2005 | journal=SIAM News | volume=38 | issue=9}}</ref>

[[Henry Cohn]], [[Robert Kleinberg]], [[Balázs Szegedy]] and [[ChristopherChris Umans]] have re-derived the Coppersmith–Winograd algorithm using a [[group theory|group-theoretic]] construction. They also showed that either of two different conjectures would imply that the optimal exponent of matrix multiplication is 2, as has long been suspected. However, they were not able to formulate a specific solution leading to a better running-time than Coppersmith-Winograd at the time.<ref>

{{cite doi|10.1109/SFCS.2005.39}}

</ref>