O'Neil 1973 (Boolean Matrix Multiplication Matrix Product)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1973

Reference

https://core.ac.uk/download/pdf/82467126.pdf