Check out my first novel, midnight's simulacra!

Strassen's Algorithm: Difference between revisions

From dankwiki
(Created page with 'Category: Computer Science Eponyms')
 
No edit summary
Line 1: Line 1:
A matrix multiplication algorithm which replaces one recursive matrix multiplication with 18 matrix additions (compared to [[Winograd's Algorithm|Winograd's]] 18), yielding O(n<sup>2.81</sup>) asymptotic performance.
[[Category: Computer Science Eponyms]]
[[Category: Computer Science Eponyms]]

Revision as of 00:46, 30 September 2009

A matrix multiplication algorithm which replaces one recursive matrix multiplication with 18 matrix additions (compared to Winograd's 18), yielding O(n2.81) asymptotic performance.