Larsen, Williams (follows from Theorem 2.1) ( Online Matrix Vector Multiplication (OMV))

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^({11}/{4})$ / sqrt(log n)) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Cell Probe == Year == 2017 == Reference == https://epubs.siam.org/doi/abs/10.1137/1.9781611974782.142")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^({11}/{4})$ / sqrt(log n))

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Cell Probe

Year

2017

Reference

https://epubs.siam.org/doi/abs/10.1137/1.9781611974782.142

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