Strassen's algorithm (Matrix Multiplication Matrix Product)

From Algorithm Wiki
Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (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.ezproxy.canberra.edu.au/article/10.1007%2FBF02165411")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Reference

https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007%2FBF02165411

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Strassen%27s_algorithm_(Matrix_Multiplication_Matrix_Product)&oldid=44395"