Revision as of 22:24, 25 April 2006 edit Mellum (talk \| contribs) Extended confirmed users 819 edits The bio link clearly is redundant, and "Strassen hypothesis" gives zero google hits. So revert again. ← Previous edit		Revision as of 09:42, 5 May 2006 edit undo Jitse Niesen (talk \| contribs) Extended confirmed users 17,194 edits in fact, Cohn et al also found 2.376; move their paper to reference section Next edit →
Line 3: The Coppersmith–Winograd algorithm is frequently used as building block in other algorithms to prove theoretical time bounds, but it appears to be not particularly practical for implementations. ~~A newer approach by~~ [[Henry Cohn]], [[Robert Kleinberg]], [[Balázs Szegedy]] and [[Christopher Umans]] ~~gets~~have rederived the ~~exponent~~Coppersmith–Winograd ~~2.41~~algorithm ~~via~~using a [[group theory\|group-theoretic]] ~~approach~~construction. ==References== * Henry Cohn, Robert Kleinberg, Balazs Szegedy, and Chris Umans. Group-theoretic Algorithms for Matrix Multiplication. {{arXiv\|archive=math.GR\|id=0511460}}. ''Proceedings of the 46th Annual Symposium on Foundations of Computer Science'', 23-25 October 2005, Pittsburgh, PA, IEEE Computer Society, pp. 379–388. * [[Don Coppersmith]] and [[Shmuel Winograd]]. Matrix multiplication via arithmetic progressions. ''Journal of Symbolic Computation'', 9:251–280, 1990. ~~==External links==~~ * [http://front.math.ucdavis.edu/math.GR/0511460 Article] by Cohn/Kleinberg/Szegedy/Umans [[Category:Numerical linear algebra]]

Coppersmith–Winograd algorithm: Difference between revisions