Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3} * (log w)$^{3} / (w * log^{2} n))
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM with word size w > log n
Year
2015