Yu (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
Jump to navigation
Jump to search
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/science/article/pii/S0890540118300099