(Boolean Matrix Multiplication (Combinatorial) Matrix Product)

From Algorithm Wiki

Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3} / log^{2.25} n)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2018 == Reference == https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.4")

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

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2018

Reference

https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.4

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