View source for Orthogonal Vectors Hypothesis (OVH)

== Target Problem == 

[[OV]]

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

[[Strong Exponential Time Hypothesis (SETH)|SETH]], [[Unbalanced Orthogonal Vectors Hypothesis (UOVH)|UOVH]]

== Implied by the following Hypothesis == 

[[k-OV Hypothesis|k-OV Hypothesis]], [[Unbalanced Orthogonal Vectors Hypothesis (UOVH)|UOVH]]

== Computation Model == 



== Proven? == 

No

== Year == 



== References/Citation == 

https://arxiv.org/pdf/1502.01063.pdf