Yu (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3}*poly(log log n)$/log^{4} n) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM with word size w = Omega(log n) == Year == 2015 == Reference == https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0890540118300099")
Time Complexity
$O(n^{3}*poly(log log n)$/log^{4} n)
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM with word size w = Omega(log n)
Year
2015
Reference
https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0890540118300099