Online matrix-vector multiplication problem
In computational complexity theory, the online matrix-vector multiplication problem (OMv) asks an online algorithm to return, at each round, the product of an n\times n matrix and a newly-arrived n -dimensional vector.
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computational complexity theory, the online matrix-vector multiplication problem (OMv) asks an online algorithm to return, at each round, the product of an n\times n matrix and a newly-arrived n -dimensional vector. OMv is conjectured to require roughly cubic time. This conjectured hardness implies lower bounds on the time needed to solve various dynamic problems and is of particular interest in fine-grained complexity.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1327696966 under CC BY-SA 4.0; modifications have been made.