Revision as of 22:39, 17 August 2012 edit 134.113.238.2 (talk) No edit summary ← Previous edit		Revision as of 17:08, 24 August 2012 edit undo Giftlite (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,854 edits m mv refs down Next edit →
Line 13: {{cite doi\|10.1109/SFCS.2005.39}} </ref> == References ==▼ {{reflist}}▼ * {{Citation \| doi=10.1016/S0747-7171(08)80013-2 \| 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=Williams \| first1=Virginia \| title=Breaking the Coppersmith-Winograd barrier \| url=http://www.cs.berkeley.edu/~virgi/matrixmult.pdf \| year=2011}}.▼ == See also == Line 24 ⟶ 19: * [[Strassen algorithm]] ▲== References == ▲{{reflist}} ▲* {{Citation \| doi=10.1016/S0747-7171(08)80013-2 \| 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=Williams \| first1=Virginia \| title=Breaking the Coppersmith-Winograd barrier \| url=http://www.cs.berkeley.edu/~virgi/matrixmult.pdf \| year=2011}}. {{Numerical linear algebra}}

Coppersmith–Winograd algorithm: Difference between revisions