K-OV Hypothesis

From Algorithm Wiki
Revision as of 10:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== Target Problem == k-OV == Description == No randomized algorithm can solve k-OV on instances of size $n$ in $n^{k-\epsilon}\poly(d)$ time for constant $\epsilon > 0$. == Implies the following Hypothesis == == Implied by the following Hypothesis == == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? == No == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 4")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Target Problem

k-OV

Description

No randomized algorithm can solve k-OV on instances of size $n$ in $n^{k-\epsilon}\poly(d)$ time for constant $\epsilon > 0$.

Implies the following Hypothesis

Implied by the following Hypothesis

Computation Model

Word-RAM on $\log(n)$ bit words

Proven?

No

Year

References/Citation

http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 4

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=K-OV_Hypothesis&oldid=44335"