# Unbalanced Orthogonal Vectors Hypothesis (UOVH)

Jump to navigation
Jump to search

## 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