Strassen's algorithm (Matrix Multiplication Matrix Product)
Jump to navigation
Jump to search
Time Complexity
$O(n^{(log54/log5)}) ~ O(n^{({2.4785})})$
Space Complexity
$O(n^{2})$ words
(Re-use of space in recursive branches)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1986
Reference
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/abstract/document/4568194