Williams ( Online Matrix Vector Multiplication (OMV))
Jump to navigation
Jump to search
Time Complexity
$O(n^{3} / (log n)$^{2})
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2007
Reference
http://www.cs.cmu.edu/~./theorylunch/pastSemesterIndices/slides/20070117.pdf