Online Matrix Vector Multiplication Hypothesis (OMV Hypothesis): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 10:3010:30, 15 February 2023‎ Admin talk contribs‎ 541 bytes +541‎ Created page with "== Target Problem == OMV == Description == Every (randomized) algorithm that can process a given $n \times n$ Boolean matrix $A$, and then in an online way can compute the products $Av_i$ for any $n$ vectors $v_1,\ldots,v_n$, must take total time $n^{3-o(1)}$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No == Year == == References/Citatio..."
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Online_Matrix_Vector_Multiplication_Hypothesis_(OMV_Hypothesis)"