# Orthogonal Vectors Hypothesis (OVH)

Jump to navigation
Jump to search

## Target Problem

## Description

For no $\epsilon > 0$ there is an algorithm for OV, restricted to $n = m$, that runs in time $O(n^{(2−\epsilon)}poly(d))$.

## Implies the following Hypothesis

## Implied by the following Hypothesis

## Computation Model

## Proven?

No