Orthogonal Vectors Hypothesis (OVH): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3011:30, 15 February 2023‎ Admin talk contribs‎ 594 bytes +594‎ Created page with "== 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 == SETH, UOVH == Implied by the following Hypothesis == k-OV Hypothesis, UOVH == Compu..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Orthogonal_Vectors_Hypothesis_(OVH)"