(Boolean Matrix Multiplication (Combinatorial) Matrix Product)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3} / log^{2.25} n)$
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2018
Reference
https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.4