Pan's algorithm (Matrix Multiplication Matrix Product)
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