Strassen's algorithm (Matrix Multiplication Matrix Product): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tags: Manual revert Reverted |
No edit summary Tags: Manual revert Reverted |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{( | $O(n^{(log7/log2)}) ~ O(n^{2.{80}7})$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 7: | Line 7: | ||
$O(n^{2})$ words | $O(n^{2})$ words | ||
( | (http://www.cs.cmu.edu/afs/cs/academic/class/15750-s17/ScribeNotes/lecture1.pdf) | ||
== Description == | == Description == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1969 | |||
== Reference == | == Reference == | ||
https:// | https://link.springer.com/article/10.1007%2FBF02165411 | ||
Revision as of 10:17, 28 April 2023
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