The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the complexity of intersecting finite state automata and NL versus NP
Theoretical Computer Science
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The complexity of quasigroup isomorphism and the minimum generating set problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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(\sqrt{f(n)polylog f(n)})}.