Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product)

From Algorithm Wiki

Revision as of 09:53, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Reference

https://ieeexplore.ieee.org/abstract/document/5438580

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bansal,_Williams_(Boolean_Matrix_Multiplication_(Combinatorial)_Matrix_Product)&oldid=47550"