Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tags: Manual revert Reverted |
No edit summary Tag: Manual revert |
||
| 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 | |||
Revision as of 09:30, 10 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