On the Limitations of Locally Robust Positive Reductions

Polynomial-time positive reductions, as introduced by Selman, are by definition globally robust — they are positive with respect to all oracles. This paper studies the extent to which the theory of positive reductions remains intact when their global robustness assumption is removed.

[1]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[2]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  Samuel R. Buss,et al.  On Truth-Table Reducibility to SAT , 1991, Inf. Comput..

[5]  Neil Immerman,et al.  Sparse Sets in NP-P: EXPTIME versus NEXPTIME , 1985, Inf. Control..

[6]  Ker-I Ko,et al.  On Helping by Robust Oracle Machines , 1987, Theor. Comput. Sci..

[7]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[8]  Juris Hartmanis,et al.  One-way functions, robustness, and the non-isomorphism of NP-complete sets , 1987, SCT.

[9]  Ker-I Ko.  On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

[10]  Ker-I Ko,et al.  On Sets Truth-Table Reducible to Sparse Sets , 1988, SIAM J. Comput..

[11]  Ronald V. Book,et al.  Tally Languages and Complexity Classes , 1974, Inf. Control..

[12]  Gábor Tardos,et al.  Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA? , 1989, Comb..

[13]  Sanjay Jain,et al.  On the Limitations of Locally Robust Positive Reductions , 1991, Int. J. Found. Comput. Sci..

[14]  Alan L. Selman,et al.  Analogues of Semicursive Sets and Effective Reducibilities to the Study of NP Complexity , 1982, Inf. Control..

[15]  Uwe Schöning,et al.  Robust Algorithms: A Different Approach to Oracles , 1985, Theor. Comput. Sci..

[16]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[17]  Alan L. Selman,et al.  Reductions on NP and P-Selective Sets , 1982, Theor. Comput. Sci..

[18]  Manuel Blum,et al.  Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[19]  Jin-Yi Cai,et al.  Graph Minimal Uncolorability is D^P-Complete , 1987, SIAM J. Comput..

[20]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[21]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..