Advertisement

Honest polynomial-time degrees of elementary recursive sets

  • Klaus Ambos-Spies
  • Dongping Yang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 440)

Keywords

Polynomial Time Order Theory Complete Problem Minimal Pair Finite Lattice 
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.

References

  1. [Am85]
    K.Ambos-Spies, On the structure of the polynomial time degrees of recursive sets (Habilitationsschrift), Tech. Rep. Nr. 206, Abteilung Informatik, Universität Dortmund.Google Scholar
  2. [Am86]
    K. Ambos-Spies, 1986 Inhomogeneities in the polynomial time degrees: the degrees of super sparse sets, Information Processing Letters 22,113–117.Google Scholar
  3. [Am87]
    K. Ambos-Spies, 1987 Minimal pairs for polynomial time reducibilities, in "Computation Theory and Logic" (E.Börger, ed.) Lecture Notes in Computer Science, vol. 270,1–13, Springer Verlag.Google Scholar
  4. [Am89]
    K. Ambos-Spies, 1989 Honest polynomial time reducibilities and the P=?NP problem, Journal of Computer and System Sciences 39, 250–281. [Extended Abstract: Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem, in "Structure in Complexity Theory Second Annual Conference", IEEE Comput. Soc. Press, 1987, 60–68.]Google Scholar
  5. [AmHoSo90]
    K. Ambos-Spies,S. Homer and R.I. Soare, 1990 Minimal pairs and complete problems, in "STACS 90, Proceedings", Lecture Notes in Comput. Sci. 415, 24–36, Springer Verlag.Google Scholar
  6. [AmHoYa90]
    K.Ambos-Spies, S.Homer and D.Yang, Honest polynomial reductions and exptally sets, to appear in "Recursion Theory Week, Oberwolfach 1989, Proceedings", Lecture Notes in Math., Springer Verlag.Google Scholar
  7. [BeHa77]
    L. Berman and J. Hartmanis, 1977 On isomorphism and density of NP and other complete sets, SIAM J. Comput. 1, 305–322.Google Scholar
  8. [ChMa81]
    P. Chew and M. Machtey, A note on structure and looking back applied to the relative complexity of computable functions, J. Comput. System Sci. 22, 53–59.Google Scholar
  9. [Co71]
    S.A.Cook, The complexity of theorem proving procedures, Proc. Third Annual ACM Symp. on Theory of Comput., 151–158.Google Scholar
  10. [GaHo88]
    K.Ganesan and S.Homer, Complete problems and strong polynomial reducibilities, Boston University Tech Report #88-001.Google Scholar
  11. [Ho87]
    S. Homer, 1987 Minimal degrees for polynomial reducibilities, J. Assoc. Comput. Mach. 34, 480–491.Google Scholar
  12. [HoLo87]
    S. Homer and T.J. Long, 1987 Honest polynomial degrees and P=?NP, Theor. Comput. Sci. 51, 265–280.Google Scholar
  13. [HoUl79]
    J.E. Hopcroft and J.D. Ullman, 1979 Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA.Google Scholar
  14. [Ka72]
    R.M. Karp, 1972 Reducibility among combinatorial problems, in "Complexity of Computer Computations", Plenum, New York, 85–103.Google Scholar
  15. [La75]
    R.E. Ladner, 1975 On the structure of polynomial time reducibility, J.ACM 22, 155–171.CrossRefGoogle Scholar
  16. [Sc84]
    U. Schöning, 1984 Minimal pairs for P, Theor. Comput. Sci. 31, 41–48.Google Scholar
  17. [ShSl88]
    J.Shinoda and T.A.Slaman, On the theory of the polynomial degrees of the recursive sets, to appear. [Abstract in: "Structure in Complexity Theory Third Annual Conference", IEEE Comput. Soc. Press, 1988].Google Scholar
  18. [ShSl89]
    R.A.Shore and T.A.Slaman, The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory, to appear [Abstract in: "Structure in Complexity Theory Fourth Annual Conference", IEEE Comput. Soc. Press, 1989].Google Scholar
  19. [Yo83]
    P.Young, Some structural properties of polynomial reducibilities and sets in NP, Proc. 15th Annu. ACM Symp. on Theory of Comput., 392–401.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Klaus Ambos-Spies
    • 1
  • Dongping Yang
    • 2
  1. 1.Mathematisches Institut Universität HeidelbergGermany
  2. 2.Institute of Software Academia SinicaBeijing

Personalised recommendations