Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product): Difference between revisions

From Algorithm Wiki
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 difference)

Revision as of 11:32, 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

Reference

https://epubs.siam.org/doi/abs/10.1137/0211038

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Coppersmith–Winograd_algorithm_(Matrix_Multiplication_Matrix_Product)&oldid=44398"