Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2.{49554}8})$ == 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 == 1981 == Reference == https://epubs.siam.org/doi/abs/10.1137/0211038") |
No edit summary Tag: Manual revert |
||
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2.{ | $O(n^{2.{375}5})$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1990 | |||
== Reference == | == Reference == | ||
http://www.cs.umd.edu/~gasarch/TOPICS/ramsey/matrixmult.pdf | |||
Latest revision as of 10:17, 28 April 2023
Time Complexity
$O(n^{2.{375}5})$
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
1990