Strassen's algorithm (Matrix Multiplication Matrix Product)
Jump to navigation
Jump to search
Time Complexity
$O(n^{(log7/log2)}) ~ O(n^{2.{80}7})$
Space Complexity
$O(n^{2})$ words
(http://www.cs.cmu.edu/afs/cs/academic/class/15750-s17/ScribeNotes/lecture1.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1969