Unbalanced Orthogonal Vectors Hypothesis (UOVH)
Revision as of 10:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== Target Problem == UOV == Description == Let $0 < \alpha \leq 1$. For no $\epsilon > 0$ there is an algorithm for OV, restricted to $m = \Theta(n^\alpha)$ and $d \leq n^{o(1)}$, that runs in time $O((nm)^{(1−\epsilon)})$. == Implies the following Hypothesis == SETH, OVH == Implied by the following Hypothesis == OVH == Computati...")
Target Problem
Description
Let $0 < \alpha \leq 1$. For no $\epsilon > 0$ there is an algorithm for OV, restricted to $m = \Theta(n^\alpha)$ and $d \leq n^{o(1)}$, that runs in time $O((nm)^{(1−\epsilon)})$.
Implies the following Hypothesis
Implied by the following Hypothesis
Computation Model
Proven?
No