On the limitations of locally robust positive reductions

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Hemachandra, L. A., & Jain, S. (1989). On the limitations of locally robust positive reductions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 405 LNCS, pp. 193–203). Springer Verlag. https://doi.org/10.1007/3-540-52048-1_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free