Alman, Vassilevska Williams ( Matrix Multiplication)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2.37285956})$
Space Complexity
$O(n^{2})$ words
(through re-use of space in recursive branches (response from Virginia))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2020