K-OV Hypothesis
Jump to navigation
Jump to search
Target Problem
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