Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary Tags: Manual revert Reverted |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{2.{ | $O(n^{2.{49554}8})$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
1981 | |||
== Reference == | == Reference == | ||
https://epubs.siam.org/doi/abs/10.1137/0211038 | |||
Revision as of 12:13, 15 February 2023
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