Promise problems and access to unambiguous computation
This paper studies the power of three types of access to unambiguous computation: nonadaptive access, fault-tolerant access, and guarded access. (1) Though for NP it is known that nonadaptive access has exponentially terse adaptive simulations, we show that UP has no such relativizable simulations: there are worlds in which (k+1)-truth-table access to UP is not subsumed by k-Turing access to UP. (2) Though fault-tolerant access (i.e., “1-helping” access) to NP is known to be no more powerful than NP itself, we give both structural and relativized evidence that fault tolerant access to UP suffices to recognize even sets beyond UP. Furthermore, we completely characterize, in terms of locally positive reductions, the sets that fault-tolerantly reduce to UP. (3) In guarded access, Grollmann and Selman's natural notion of access to unambiguous computation, a deterministic polynomial-time Turing machine asks questions to a nondeterministic polynomial-time Turing machine in such a way that the nondeterministic machine never accepts ambiguously. In contrast to guarded access, the standard notion of access to unambiguous computation is that of access to a set that is uniformly unambiguous—even for queries that it never will be asked by its questioner, it must be unambiguous. We show that these notions, though the same for nonadaptive reductions, differ for Turing and strong nondeterministic reductions.
KeywordsTuring Machine Relativize World Turing Reduction Tolerant Access Positive Reduction
Unable to display preview. Download preview PDF.
- S. Even and Y. Yacobi. Cryptocomplexity and NP-completeness. In Proceedings of the 7th International Colloquium on Automata, Languages, and Programming, pages 195–207. Springer-Verlag Lecture Notes in Computer Science, 1980.Google Scholar
- J. Köbler, U. Schöning, and J. Tóran. Graph isomorphism is low for PP. Technical Report 91-05, Institut für Informatik, Universität Ulm, Ulm, Germany, July 1991.Google Scholar
- M. Ogiwara and L. Hemachandra. A complexity theory for feasible closure properties. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 16–29. IEEE Computer Society Press, June/July 1991.Google Scholar
- J. Simon. On Some Central Problems in Computational Complexity. PhD thesis, Cornell University, Ithaca, N.Y., Jan. 1975. Available as Cornell Department of Computer Science Technical Report TR75-224.Google Scholar