Content deleted Content added
m Task 18 (cosmetic): eval 10 templates: del empty params (2×); |
merger tag |
||
Line 1:
{{Use dmy dates|date=July 2013}}
{{merge to|Matrix multiplication algorithm|discuss=Talk:Matrix multiplication algorithm#Merger proposal|date=April 2021}}
In [[linear algebra]], the '''Coppersmith–Winograd algorithm''', named after [[Don Coppersmith]] and [[Shmuel Winograd]], was the asymptotically fastest known [[matrix multiplication algorithm]] from 1990 until 2010. It can multiply two <math>n \times n</math> matrices in <math>\mathcal{O}(n^{2.375477})</math> time<ref name="coppersmith">{{Citation
|doi=10.1016/S0747-7171(08)80013-2
| |||