Online matrix-vector multiplication problem: Difference between revisions

Content deleted Content added
m Variants of OMv: versions -> variants
Conjectured hardness: forgot condition on eps
Line 24:
 
{{Blockquote
|text=For any constant <math>\varepsilon>0</math>, there is no <math>O(n^{3-\varepsilon})</math>-time algorithm that solves OMv with probability at least <math>2/3</math>.
}}