Check out my first novel, midnight's simulacra!
Strassen's Algorithm: Difference between revisions
From dankwiki
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
A matrix multiplication algorithm | A matrix multiplication algorithm yielding O(n<sup>2.81</sup>) asymptotic performance at the cost of some numeric stability. | ||
==See also== | |||
* [[Winograd's Algorithm]] | |||
[[Category: Computer Science Eponyms]] | [[Category: Computer Science Eponyms]] | ||
Revision as of 08:14, 14 May 2013
A matrix multiplication algorithm yielding O(n2.81) asymptotic performance at the cost of some numeric stability.
