Larsen, Williams (Theorem 1.1) ( Online Matrix Vector Multiplication (OMV))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

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

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

Yes, Monte Carlo

Model of Computation

Word RAM

Year

2017

Reference

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Larsen,_Williams_(Theorem_1.1)_(_Online_Matrix_Vector_Multiplication_(OMV))&oldid=45013"