Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

10 April 2023

15 February 2023

  • curprev 10:3210:32, 15 February 2023‎ Admin talk contribs‎ 340 bytes +340‎ 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.ezproxy.canberra.edu.au/doi/abs/10.1137/0211038"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Coppersmith–Winograd_algorithm_(Matrix_Multiplication_Matrix_Product)"