Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary Tags: Manual revert Reverted |
||
Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{3} * (log | $O(n^{3} * (log log n)$^{3} / log^{3} n) | ||
== Space Complexity == | == Space Complexity == | ||
Line 23: | Line 23: | ||
== Model of Computation == | == Model of Computation == | ||
Word RAM with word size w | Word RAM with word size w = log n | ||
== Year == | == Year == |
Revision as of 09:53, 10 April 2023
Time Complexity
$O(n^{3} * (log log n)$^{3} / log^{3} n)
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM with word size w = log n
Year
2015