Strassen's algorithm (Matrix Multiplication Matrix Product): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary Tag: Manual revert |
| (5 intermediate revisions by the same user not shown) | |
(No difference)
| |
Latest revision as of 10:17, 28 April 2023
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