Chan (Boolean Matrix Multiplication (Combinatorial) Matrix Product): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tags: Manual revert Reverted
No edit summary
Tag: Manual revert
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


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


== Space Complexity ==  
== Space Complexity ==  
Line 23: Line 23:
== Model of Computation ==  
== Model of Computation ==  


Word RAM with word size w = log n
Word RAM with word size w > log n


== Year ==  
== Year ==  

Latest revision as of 09:53, 10 April 2023

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/doi/abs/10.1137/1.9781611973730.16