Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{3} * (log log n)$^{2} / log^{2.25} n) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == Word RAM with word size w = log n == Year == 2009 == Reference == https://ieeexplore.ieee.org/abstract/document/5438580") |
No edit summary Tag: Reverted |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n^{3} * (log log n)$^{2} / log^{ | $O(n^{3} * (log log n)$^{2} / (w * (log n)^{7}/{6})) | ||
== 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 11:54, 15 February 2023
Time Complexity
$O(n^{3} * (log log n)$^{2} / (w * (log n)^{7}/{6}))
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
Yes, Las Vegas
Model of Computation
Word RAM with word size w > log n
Year
2009