Strassen's algorithm (Matrix Multiplication Matrix Product): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== 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 == Reference == https://link.springer.com/article/10.1007%2FBF02165411") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{( | $O(n^{(log54/log5)}) ~ O(n^{({2.4785})})$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 7: | Line 7: | ||
$O(n^{2})$ words | $O(n^{2})$ words | ||
( | (Re-use of space in recursive branches) | ||
== Description == | == Description == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1986 | |||
== Reference == | == Reference == | ||
https:// | https://ieeexplore.ieee.org/abstract/document/4568194 | ||
Revision as of 11:32, 15 February 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