Advertisement

Containment, separation, complete sets, and immunity of complexity classes

  • Juris Hartmanis
  • Ming Li
  • Yaacov Yesha
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 226)

Keywords

Polynomial Time Turing Machine Complexity Class Recursive Function Complementary Pair 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. [B]
    L. Berman, On the structure of complete sets: Almost everywhere complexity and infinitely often speedup, Proc. 17th IEEE FOCS (1977), 76–80.Google Scholar
  2. [B1]
    L. Berman, Polynomial reducibility and complete sets, Ph.D. thesis, Cornell University, May 1977.Google Scholar
  3. [B2]
    R. Book, Tally languages and complexity classes, Information and Control 26 (1974), pp. 186–193.Google Scholar
  4. [BGW]
    R. Book, S. Greibach, and B. Wegbreit, Time-and tape-bound Turing acceptors and AFL's, JCSS 4,6 (Dec. 1970) pp. 606–621.Google Scholar
  5. [BS]
    R. Rook and U. Schoning, Immunity, relativization and nondeterminism, to appear in SIAM J. Computing.Google Scholar
  6. [C]
    S. Cook, A hierarchy for nondeterministic time complexity, JCSS 7,4 (1973) pp. 343–353.Google Scholar
  7. [H]
    S. Homer, On simple and creative sets in NP. TR# 84/002, Department of Computer Science, Boston University.Google Scholar
  8. [H1]
    J. Hartmanis, On sparse sets in NP-P, Inf. Proc. Let. 2 (1983) pp. 55–60.Google Scholar
  9. [HI]
    J. Hartmanis and N. Immerman, On complete sets in NPCoNP, 12th ICALP, Napflion, Greece. 1985.Google Scholar
  10. [HIS]
    J. Hartmanis, N. Immerman, and V. Sewelson, On sparse sets in NP-P. EXPTIME vs. NEXPTIME, Proc. 15th ACM STOC (April 1983), pp. 382–391.Google Scholar
  11. [HLS]
    J. Hartmanis, P. Lewis, and R. Stearns, Classification of computations by time and memory requirements, Proc. IFIP Congress 65, Spartan, NY. (1965). pp. 31–35.Google Scholar
  12. [HY]
    J. Hartmanis and Y. Yesha, Computation times of NP sets of different densities, 10th ICALP, Spain (1983). Also, Special Issue of Theor. Comp. Sci. 34 (1984) pp. 17–32.Google Scholar
  13. [HU]
    J. Hopcroft and J. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley (1979).Google Scholar
  14. [K]
    W. Kowalozyk, Some connections between presentability of complexity classes and the power of formal systems of reasoning, Proc. MFCS'84 pp. 364–369.Google Scholar
  15. [L]
    N. Lynch, On reducibility to complex or sparse sets, J. ACM, 22, (1975) pp. 341–345.Google Scholar
  16. [LFM]
    N. Lynch, M. Fischer, and A. Meyer, Relativization of the theory of computational complexity, Trans. AMS.Google Scholar
  17. [L1]
    M. Li, Lower bounds in computational complexity, Ph.D. Thesis, Cornell University (1985).Google Scholar
  18. [LLR]
    L. Landweber, R. Lipton, and E. Robertson, On the structure of sets in NP and other complexity classes, Theor. Comp. Sci., 18(1982) pp. 95–103.Google Scholar
  19. [LLS]
    R. Ladner, N. Lynch, and A. Selman, Comparison of polynomial time reducibilities, Proc. STOC (1974) pp. 110–121.Google Scholar
  20. [M]
    S. Mahaney, Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis, Proc. IEEE FOCS, 1980, pp. 54–60.Google Scholar
  21. [OS]
    P. Orponen and U. Schoning, On the density of polynomial complexity cores, Proc. Math. Found. Comp. Sci. — 84, Lecture Notes in Computer Science, to appear.Google Scholar
  22. [RS]
    C. W. Rackoff and J. I. Seiferas, Limitations on separating nondeterministic complexity classes, 10, 4 SIAM Comp. (1981), pp. 742–745.Google Scholar
  23. [SFM]
    J. Seiferas, M. Fischer, and A. Meyer, Separating nondeterministic time classes, JACM, 25, 1, (1978) pp. 146–167.Google Scholar
  24. [S]
    M. Sipser, On relativization and the existence of complete sets, 9th ICALP, Lecture Notes in Computer Science, Springer Verlag, Berlin (1982) pp. 523–531.Google Scholar
  25. [Y]
    Y. Yesha, On certain polynomial-time truth-table reducibilities of complete sets to sparse sets, SIAM J. Comp. 12,3 (1983).Google Scholar
  26. [Z]
    S. Zak, A Turing machine hierarchy, to appear in Theor. Comp. Sci.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Juris Hartmanis
    • 1
  • Ming Li
    • 2
  • Yaacov Yesha
    • 2
  1. 1.Computer Science Dept.Cornell UniversityIthaca
  2. 2.Dept. of Computer and Information ScienceThe Ohio State UniversityColumbus

Personalised recommendations