On the relationship between the complexity, the degree, and the extension of a computable set

  • Wolfgang Maass
  • Theodore A. Slaman
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 1432)

Abstract

We consider the equivalence relation A =c B (“A and B have the same time complexity”) ⇔ (for all time constructible f : ADTIME(f)BDTIME(f)). In this paper we give a survey of the known relationships between this equivalence relation and degree theoretic and extensional properties of sets. Furthermore we illustrate the proof techniques that have been used for this analysis, with emphasis on those arguments that are of interest from the point of view of recursion theory. Finally we will discuss in the last section some open problems and directions for further research on this topic.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (Reading, 1974).Google Scholar
  2. [2]
    M. Blum, A machine-independent theory of the complexity of recursive functions, J. ACM, 14(1967), 322–336.MathSciNetCrossRefMATHGoogle Scholar
  3. [3]
    S.A. Cook, R.A. Reckhow, Time-bounded random access machines, J. Comp. Syst. Sc., 7(1973), 354–375.MathSciNetCrossRefMATHGoogle Scholar
  4. [4]
    A.K. Dewdney, Linear time transformations between combinatorial problems, Internat. J. Computer Math., 11(1982), 91–110.MathSciNetCrossRefMATHGoogle Scholar
  5. [5]
    J.G. Geske, D.T. Huynh, A.L. Selman, A hierarchy theorem for almost everywhere complex sets with applications to polynomial complexity degrees, Proc. of the 4th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 247 (Springer, 1987), 125–135.Google Scholar
  6. [6]
    J. Hartmanis, J.E. Hopcroft, An overview of the theory of computational complexity, J. ACM, 18(1971), 444–475.MathSciNetCrossRefMATHGoogle Scholar
  7. [7]
    R. Ladner, On the structure of polynomial-time reducibility, J. ACM, 22(1975), 155–171.MathSciNetCrossRefMATHGoogle Scholar
  8. [8]
    L. Landweber, R. Lipton, and E. Robertson, On the structure of sets in N P and other classes, TCS, 15(1981), 181–200.MathSciNetCrossRefMATHGoogle Scholar
  9. [9]
    M. Lerman, Degrees of Unsolvability, Springer (1983).Google Scholar
  10. [10]
    L.A. Levin, On storage capacity for algorithms, Soviet Math. Dokl., 14(1973), 1464–1466.MATHGoogle Scholar
  11. [11]
    N. Lynch, Helping: several formalizations, J. of Symbolic Logic, 40(1975), 555–566.MathSciNetCrossRefMATHGoogle Scholar
  12. [12]
    W. Maass, T. A. Slaman, The complexity types of computable sets (extended abstract), Proc. of the Structure in Complexity Theory Conference, 1989.Google Scholar
  13. [13]
    W. Maass, T.A. Slaman, Extensional properties of sets of time bounded complexity (extended abstract), Proc. of the 7th Int. Conf. on Fundamentals of Computation Theory, J. Csirik, J. Demetrovics, F. Gésceg, eds., Lecture Notes in Computer Science vol. 380, Springer Verlag (Berlin 1989), 318–326.CrossRefGoogle Scholar
  14. [14]
    W. Maass, T. A. Slaman, The complexity types of computable sets, in preparation.Google Scholar
  15. [15]
    M. Machtey, P. Young, An Introduction to the General Theory of Algorithms, North-Holland (Amsterdam, 1978).Google Scholar
  16. [16]
    S. Mahaney, Sparse complete sets for N P: solution of a conjecture of Berman and Hartmanis, J. Comp. Syst. Sc., 25(1982), 130–143.MathSciNetCrossRefMATHGoogle Scholar
  17. [17]
    A.R. Meyer, P.C. Fischer, Computational speed-up by effective operators, J. of Symbolic Logic, 37(1972), 55–68.MathSciNetCrossRefMATHGoogle Scholar
  18. [18]
    A.R. Meyer, K. Winklmann, The fundamental theorem of complexity theory, Math. Centre Tracts, 108(1979), 97–112.MathSciNetMATHGoogle Scholar
  19. [19]
    W.J. Paul, Komplexitaetstheorie, Teubner (Stuttgart, 1978).Google Scholar
  20. [20]
    C.P. Schnorr, G. Stumpf, A characterization of complexity sequences, Zeitschr. f. math. Logik u. Grundlagen d. Math., 21(1975), 47–56.MathSciNetCrossRefMATHGoogle Scholar
  21. [21]
    J. Shinoda, T.A. Slaman, On the theory of the PTIME degrees of the recursive set, Proc. of Structure in Complexity Theory Conference, 1988, 252–257.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Wolfgang Maass
    • 1
  • Theodore A. Slaman
    • 2
  1. 1.Dept. of Math., Stat., and Comp. Sci.University of Illinois at ChicagoChicago
  2. 2.Dept. of MathematicsUniversity of ChicagoChicago

Personalised recommendations