Alman, Vassilevska Williams ( Matrix Multiplication)
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://arxiv.org/pdf/2010.05846.pdf")
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