Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product)

From Algorithm Wiki

Revision as of 08: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 w)$^{3} / (w * log^{2} n))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM with word size w > log n

Year

2015

Reference

https://epubs-siam-org.ezproxy.canberra.edu.au/doi/abs/10.1137/1.9781611973730.16

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