Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product)

From Algorithm Wiki

Revision as of 08:30, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/doi/abs/10.1137/0211038

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