Revision as of 14:09, 20 April 2010 edit Aholtzma (talk \| contribs) 3 edits Add url for paper ← Previous edit		Revision as of 14:10, 20 April 2010 edit undo Aholtzma (talk \| contribs) 3 edits No edit summary Next edit →
Line 8: * 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. * {{Citation \| last1=Coppersmith \| first1=Don \|last2= Winograd \| first2=Shmuel \| title=Matrix multiplication via arithmetic progressions \| url=http://www.cs.umd.edu/~gasarch/ramsey/matrixmult.pdf \| year=1990 \| journal=Journal of Symbolic Computation\| volume=9 \| issue=3 \| pages=251-280}}. * {{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}}.

Coppersmith–Winograd algorithm: Difference between revisions