Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{3}/(log n)$^{2})

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1970

Reference

https://scholar.google.com/scholar?hl=en&as_sdt=0%2C22&q=On+economical+construction+of+the+transitive+closure+of+an+oriented+graph.&btnG=

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