Content deleted Content added
mNo edit summary |
simplify |
||
Line 1:
In the [[mathematics|mathematical]] discipline of [[linear algebra]], the '''Coppersmith-Winograd algorithm''' is the fastest currently known [[algorithm]] for square [[matrix multiplication]]. It can multiply two <math>n \times n</math> matrices in <math>O(n^{2.376})</math> time. This is an improvement over the trivial <math>O(n^3)</math> time algorithm and the <math>n^{2.807}</math> time [[Strassen algorithm]]. It might be possible to improve the exponent further; however,
== References ==
|