Coppersmith–Winograd algorithm: Difference between revisions

Revision as of 12:57, 25 July 2017

Revision as of 12:58, 25 July 2017

Line 17:

[[Henry Cohn]], [[Robert Kleinberg]], [[Balázs Szegedy]] and [[Chris 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 book | last1 = Cohn | first1 = H. | last2 = Kleinberg | first2 = R. | last3 = Szegedy | first3 = B. | last4 = Umans | first4 = C. | chapter = Group-theoretic Algorithms for Matrix Multiplication | doi = 10.1109/SFCS.2005.39 | title = 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) | pages = 379 | year = 2005 | isbn = 0-7695-2468-0 | pmid = | pmc = }}</ref>

== References ==

{{Reflist}}

== See also ==

Line 25 ⟶ 22:

* [[Gauss–Jordan elimination]]

* [[Strassen algorithm]]

== References ==

{{Reflist}}

== Further reading ==