Abstract
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.
We note that two-sided locally robust positive reductions — reductions that are positive with respect to the oracle to which the reduction is made — are sufficient to retain all crucial properties of globally robust positive reductions. In contrast, we prove absolute and relativized results showing that one-sided local robustness fails to preserve fundamental properties of positive reductions, such as the downward closure of NP.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported in part by the National Science Foundation under grants CCR-8809174, CCR-8996198 and Presidential Young Investigator Award CCR-8957604.
Supported by National Science Foundation grant CER 5-285-25 to the University of Rochester.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Allender. Limitations of the upward separation technique. In Automata, Languages, and Programming (ICALP 1989). Springer-Verlag Lecture Notes in Computer Science. To appear.
M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In 28th Annual IEEE Symposium on Foundations of Computer Science, October 1987.
R. Book and K. Ko. On sets truth-table reducible to sparse sets. SIAM Journal on Computing, 17(5):903–919, 1988. own.
R. Book. Tally languages and complexity classes. Information and Control, 26:186–193, 1974.
R. Book, C. Wrathall, A. Selman, and D. Dobkin. Inclusion languages and the Berman-Hartmanis conjecture. Mathematical Systems Theory, 11:1–8, 1978.
J. Hartmanis and L. Hemachandra. Oneway functions, robustness, and the non-isomorphism of NP-complete sets. In Proceedings 2nd Structure in Complexity Theory Conference, pages 160–174. IEEE Computer Society Press, June 1987.
J. Hartmanis, N. Immerman, and V. Sewelson. Sparse sets in NP-P: EXPTIME versus NEXPTIME. Information and Control, 65(2/3):159–181, May/June 1985.
L. Hemachandra and S. Jain. On the limitations of locally robust positive reductions. Technical Report TR-300, University of Rochester, Department of Computer Science, Rochester, NY, 14627, July 1989.
J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
K. Ko. On self-reducibility and weak P-selectivity. Journal of Computer and System Sciences, 26:209–221, 1983.
K. Ko. On helping by robust oracle machines. Theoretical Computer Science, 52:15–36, 1987.
R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103–124, 1975.
U. Schöning. Robust algorithms: A different approach to oracles. Theoretical Computer Science, 40:57–66, 1985.
A. Selman. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Mathematical Systems Theory, 13:55–65, 1979.
A. Selman. Analogues of semirecursive sets. Information and Control, 52:36–51, 1982.
A. Selman. Reductions on NP and P-selective sets. Theoretical Computer Science, 19:287–304, 1982.
G. Tardos. Query complexity, or why is it difficult to separate NPN ∩ coNPA from PA by random oracles A. Manuscript, July 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hemachandra, L.A., Jain, S. (1989). On the limitations of locally robust positive reductions. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_44
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive