RSN1-tt (NP) distinguishes robust many-one and Turing completeness

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1203, Issue , 1997, Pages 49-60

  Hemaspaandra, Edith ^a   Hemaspaandra, Lane A ^b   Hempel, Harald ^c  

^a LE MOYNE COLLEGE   (United States)

^b University of Rochester   (United States)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLETE SETS; COMPLEXITY CLASS; DOWNWARD CLOSURE; NATURAL COMPLEXITY CLASS; PARALLEL ACCESS TO NP; TURING COMPLETENESS; TURING-COMPLETE;

COMPUTATIONAL COMPLEXITY;

EID: 84957649474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62592-5_60     Document Type: Conference Paper

References (33)

1. [AH87] L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Proceedinqs of the 19th ACM Symposium on Theory of Computinq, pages 462-469. ACM Press, May 1987.
2. [Amb86] K. Ambos-Spies. A note on complete problems for complexity classes. Information Processing Letters, 23:227-230, 1986.
3. [BC93] D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993.
4. [BCS92] D. Bovet, P. Crescenzi, and R. Silvestri. A uniform approach to define complexity classes. Theoretical Computer Science, 104(2):263-283, 1992.
5. [BDG95] J. Balcázar, J. Diaz, and J. Gabarró. Structural Complexity I. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, 2nd edition, 1995.
6. [BGS75] T. Baker, J. Gill, and R. Solovay. Relativizations of the P=?NP question. SIAM Journal on Computing, 4(4):431-442, 1975.
7. [Bor94] B. Borchert. Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages. PhD thesis, Universität Heidelberg, Mathematisches Institut, Heidelberg, Germany, 1994.
8. +88] J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232-1252, 1988.
9. [FK92] M. Fellows and N. Koblitz. Self-witnessing polynomial-time complexity and prime factorization. In Proceedings of the 7th Structure in Complexity Theory Conference, pages 107-110. IEEE Computer Society Press, June 1992.
10. [Gur83] Y. Gurevich. Algebras of feasible functions. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 210-214. IEEE Computer Society Press, November 1983.
11. [HH88] J. Hartmanis and L. Hemachandra. Complexity classes without machines: On complete languages for UP. Theoretical Computer Science, 58:129-142, 1988.
12. [HHH] E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. A downward translation in the polynomial hierarchy. In Proceedings of the l4th Annual Symposium on Theoretical Aspects of Computer Science. Springer-Verlag Lecture Notes in Computer Science.
13. [HHH96] E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Query order in the polynomial hierarchy. Technical Report TR-634, University of Rochester, Department of Computer Science, Rochester, NY, September 1996.
14. [HHW] L. Hemaspaandra, H. Hempel, and G. Wechsung. Query order. SIAM Journal on Computing. To appear.
15. [HJV93] L. Hemaspaandra, S. Jain, and N. Vereshchagin. Banishing robust Turing completeness. International Journal of Foundations of Computer Science, 4(3):245-265, 1993.
16. [HL94] S. Homer and L. Longpré. On reductions of NP sets to sparse sets. Journal of Computer and System Sciences, 48(2):324-336, 1994.
17. [Kad88] J. Kadin. The polynomial time hierarchy collapses if the boolean hierarchy collapses. SIAM Journal on Computing, 17(6):1263-1282, 1988. Erratum appears in the same journal, 20(2):404.
18. [KSW87] J. Köbler, U. Schöning, and K. Wagner. The difference and truth-table hierarchies for NP. RAIRO Theoretical Informatics and Applications, 21:419-435, 1987.
19. [LLS75] R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103-124, 1975.
20. [LM96] J. Lutz and E. Mayordomo. Cook versus Karp-Levin: Separating completeness notions if NP is not small. Theoretical Computer Science, 164(1-2): 123-140, 1996.
21. [Lon82] T. Long. Strong nondeterministic polynomial-time reducibilities. Theoretical Computer Science, 21:1-25, 1982.
22. [LY90] L. Longpré and P. Young. Cook Reducibility Is Faster than Karp reducibility in NP. Journal of Computer and System Sciences, 41(3):389-401, 1990.
23. [OW91] M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computinq, 20(3):471-483, June 1991.
24. [Pap94] C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
25. [PY84] C. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). Journal of Computer and, System Sciences, 28(2):244-259, 1984.
26. [Reg89] K. Regan. Provable complexity properties and constructive reasoning. Manuscript, April 1989.
27. [Rog67] H. Rogers, Jr. The Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.
28. [Sel78] A. Selman. Polynomial time enumeration reducibility. SIAM Journal on Computing, 7(4):440-457, 1978.
29. [Sel94a] V. Selivanov. Two refinements of the polynomial hierarchy. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, pages 439-448. Springer-Verlag Lecture Notes in Computer Science, February 1994.
30. [Sel94b] A. Selman. A taxonomy of complexity classes of functions. Journal of Computer and System Sciences, 48(2):357-381, 1994.
31. [Sip82] M. Sipser. On relativization and the existence of complete sets. In Proceedings of the 9th International Colloquium on Automata, Languages, and Programming, pages 523-531. Springer-Verlag Lecture Notes in Computer Science #140, 1982.
32. [Wag90] K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.
33. [WT92] O. Watanabe and S. Tang. On polynomial-time Turing and many-one completeness in PSPACE. Theoretical Computer Science, 97(2):199-215, 1992.