Bansal, Williams (Boolean Matrix Multiplication (Combinatorial) Matrix Product): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tag: Reverted
No edit summary
Tag: Manual revert
 
(One intermediate revision by the same user not shown)
(No difference)

Latest revision as of 09:53, 10 April 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

Reference

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