On Limited versus Polynomial Nondeterminism

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)})}.

[1]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[2]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[3]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[4]  Michael R. Fellows,et al.  On the complexity of fixed parameter problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[5]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[6]  Rafail Ostrovsky,et al.  Software protection and simulation on oblivious RAMs , 1996, JACM.

[7]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[8]  Carl Pomerance,et al.  The Development of the Number Field Sieve , 1994 .

[9]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues , 1995, Ann. Pure Appl. Log..

[10]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[11]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[12]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[13]  David Eppstein,et al.  3-Coloring in time O(1.3446n): A no-MIS Algorithm , 1995, Electron. Colloquium Comput. Complex..

[14]  Daniel A. Spielman,et al.  Nearly-linear size holographic proofs , 1994, STOC '94.

[15]  Zvi Galil,et al.  Proceedings of the 30th IEEE symposium on Foundations of computer science , 1994, FOCS 1994.

[16]  David Zuckerman,et al.  On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..

[17]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[18]  Liming Cai,et al.  On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract) , 1993, MFCS.

[19]  Bernd Voigt,et al.  Finding Minimally Weighted Subgraphs , 1991, WG.

[20]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[21]  Mam Riess Jones.  Color Coding , 1962, Human factors.

[22]  Mihalis Yannakakis,et al.  On limited nondeterminism and the complexity of the V-C dimension , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.