Coppersmith–Winograd algorithm: Difference between revisions

Revision as of 12:06, 10 July 2011

Revision as of 12:14, 10 July 2011

Line 3:

The Coppersmith–Winograd algorithm is frequently used as a building block in other algorithms to prove theoretical time bounds. 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 [[Christopher Umans]] have rederived the Coppersmith–Winograd algorithm using a [[group theory|group-theoretic]] construction{{citationCitation needed|date=July 2011}}. They also show that either of two different conjectures would imply that the optimal exponent of matrix multiplication is 2, as has long been suspected{{citationCitation needed|date=July 2011}}.

==References==