Pan's algorithm (Matrix Multiplication Matrix Product)

From Algorithm Wiki
Revision as of 10:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{(log({143640})/log({70}))}) ~ O(n^{2.{79}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 == 1978 == Reference == https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/4567976")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{(log({143640})/log({70}))}) ~ O(n^{2.{79}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

1978

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/4567976

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Pan%27s_algorithm_(Matrix_Multiplication_Matrix_Product)&oldid=44396"