Content deleted Content added
MIT Trekkie (talk | contribs) m copy-edit |
Reason for n² as lowest limit |
||
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, it has been shown that the exponent must be at least 2 (because an <math>n \times n</math> matrix has <math>n^2</math> values, and all of them have to be read at least once to calculate the exact result). The Coppersmith-Winograd algorithm is frequently used as building block in other algorithms to prove run time bounds, but it appears to be not particularly practical for implementations.
== References ==
| |||