Revision as of 08:19, 8 February 2006 edit SebastianBreier~enwiki (talk \| contribs) 176 edits m case ← Previous edit		Revision as of 07:54, 12 February 2006 edit undo Dysprosia (talk \| contribs) 28,388 edits m headers begin at ==, not = Next edit →
Line 3: A newer approach by [[Henry Cohn]], [[Robert Kleinberg]], [[Balázs Szegedy]] and [[Christopher Umans]] gets the exponent 2.41 via a [[group-theoretic]] approach. == References == * [[Don Coppersmith]] and [[Shmuel Winograd]]. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251–280, 1990. =e= Web links == * [http://front.math.ucdavis.edu/math.GR/0511460 Article] by Cohn/Kleinberg/Szegedy/Umans

Coppersmith–Winograd algorithm: Difference between revisions