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

Theory of Computing Systems

Volumn 31, Issue 3, 1998, Pages 307-325

  Hemaspaandra, E ^a   Hemaspaandra, L A ^b   Hempel, H ^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

COMPUTER SCIENCE; MATHEMATICAL TECHNIQUES;

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

COMPUTATIONAL COMPLEXITY;

EID: 0032386789     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240000090     Document Type: Article

References (42)

1. L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 462-469. ACM Press, New York, May 1987.
2. K. Ambos-Spies. A note on complete problems for complexity classes. Information Processing Letters, 23:227-230, 1986.
3. D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1993.
4. R. Beigel and R. Chang. Commutative queries. In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, pages 159-165. IEEE Computer Society Press, Los Alamitos, CA, June 1997.
5. D. Bovet, P. Crescenzi, and R. Silvestri. A uniform approach to define complexity classes. Theoretical Computer Science, 104(2):263-283, 1992.
6. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, 2nd edition. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, New York, 1995.
7. H. Buhrman and L. Fortnow. Two Queries. Technical Report 96-20, Department of Computer Science, University of Chicago, Chicago, IL, September 1996.
8. T. Baker, J. Gill, and R. Solovay. Relativizations of the P=?NP question. SIAM Journal on Computing, 4(4):431-442, 1975.
9. B. Borchert. Predicate Classes, Promise Classes, and the Acceptance Power of Regular Languages. Ph.D. thesis, Mathematisches Institut, Universität Heidelberg, Heidelberg, 1994.
10. 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.
11. J. Cai, L. Hemachandra, and J. Vyskoč. Promises and fault-tolerant database access. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory, pages 101-146. Cambridge University Press, Cambridge, 1993.
12. 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, New York, June 1992.
13. J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17(2):309-335, 1988.
14. 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, New York, November 1983.
15. J. Hartmanis and L. Hemachandra. Complexity classes without machines: on complete languages for UP. Theoretical Computer Science, 58:129-142, 1988.
16. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. A downward collapse within the polynomial hierarchy. SIAM Journal on Computing. To appear.
17. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Query order in the polynomial hierarchy. In Proceedings of the 11th Conference on Fundamentals of Computation Theory, pages 222-232. Lecture Notes in Computer Science #1279. Springer-Verlag, Berlin, September 1997.
18. 1-tt (NP) distinguishes robust many-one and Turing completeness. In Proceedings of the 3rd Italian Conference on Algorithms and Complexity, pages 49-60. Lecture Notes in Computer Science #1203. Springer-Verlag, Berlin, March 1997.
19. E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. Translating Equality Downwards. Technical Report TR-657, Department of Computer Science, University of Rochester, Rochester, NY, April 1997.
20. L. Hemaspaandra, H. Hempel, and G. Wechsung. Query order. SIAM Journal on Computing. To appear.
21. L. Hemaspaandra, S. Jain, and N. Vereshchagin. Banishing robust Turing completeness. International Journal of Foundations of Computer Science, 4(3):245-265, 1993.
22. S. Homer and L. Longpré. On reductions of NP sets to sparse sets. Journal of Computer and System Sciences, 48(2):324-336, 1994.
23. 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.
24. 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.
25. R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103-124, 1975.
26. 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.
27. T. Long. Strong nondeterministic polynomial-time reducibilities. Theoretical Computer Science, 21:1-25, 1982.
28. 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.
29. M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing, 20(3):471-483, June 1991.
30. C. Papadimitriou. Computational Complexity. Reading, MA, Addison-Wesley, 1994.
31. 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.
32. K. Regan. Provable complexity properties and constructive reasoning. Manuscript, April 1989.
33. C. Rich. Positive relativizations of the P=?NP problem. Journal of Computer and System Sciences, 38(3):511-523, 1989.
34. H. Rogers, Jr. The Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967.
35. A. Selman. Polynomial time enumeration reducibility. SIAM Journal on Computing, 7(4):440-457, 1978.
36. V. Selivanov. Two refinements of the polynomial hierarchy. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, pages 439-448. Lecture Notes in Computer Science #775. Springer-Verlag, Berlin, February 1994.
37. A. Selman. A taxonomy of complexity classes of functions. Journal of Computer and System Sciences, 48(2):357-381, 1994.
38. 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. Lecture Notes in Computer Science #140. Springer-Verlag, Berlin, 1982.
39. A. Selman, M. Xu, and R. Book. Positive relativizations of complexity classes. SIAM Journal on Computing, 12(3):565-579, 1983.
40. K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.
41. K. Wagner. A Note on Parallel Queries and the Difference Hierarchy. Technical Report 173, Institut für Informatik, Universität Würzburg, Würzburg, June 1997.
42. [WT] O. Watanabe and S. Tang. On polynomial-time Turing and many-one completeness in PSPACE. Theoretical Computer Science, 97(2):199-215, 1992.