On Limited versus Polynomial Nondeterminism
Uriel Feige, Joe Kilian · 1997
In this paper, we show that efficient algorithms for some problems that require limited nondeterminism imply the subexponential simulation of nondeterministic computation by deterministic computation. In particular, if cliques of size O(log n) can be found in polynomial time, then nondeterministic time f(n) is contained in deterministic time 2 O( p f(n)polylogf(n)) .