On diagonalization methods and the structure of language classes

  • Kenneth W. Regan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


Recursive Function Language Class Diagonalization Method Primitive Recursive Dense Language 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BH77]
    L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comp. 6, 1977, pp 305–321.CrossRefGoogle Scholar
  2. [CM81]
    P. Chew and M. Machtey. A note on structure and looking-back (...) J. Comp. Sys. Sci. 22, 1981, pp 53–59.CrossRefGoogle Scholar
  3. [HU79]
    J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, And Computation. (Reading, Mass: Addison-Wesley 1979)Google Scholar
  4. [Kz80]
    D. Kozen. Indexings of subrecursive classes. Theoretical Computer Science 11, 1980, pp 277–301.Google Scholar
  5. [Lad75]
    R. Ladner. On the structure of polynomial-time reducibility. J. ACM 22, 1975, pp 155–171.Google Scholar
  6. [LLR81]
    L. Landweber, R. Lipton, and E. Robertson. On the structure of sets in NP and other classes. TCS 15, 1981, pp 181–200.Google Scholar
  7. [Re82]
    K. Regan. Computability, enumerability, and the polynomial hierarchy. M.Sc. qualifying dissertation, Oxford, 1982.Google Scholar
  8. [Re83]
    K. Regan. Arithmetical degrees of index sets for complexity classes. Draft, in preparation for submission to TCS in 1983.Google Scholar
  9. [Rog67]
    H. Rogers. Theory of Recursive Functions and Effective Computability. (New York: McGraw-Hill, 1967).Google Scholar
  10. [Sö81]
    U. Schöning. Untersuchungen zur Struktur von NP... Ph.D. dissertation, Stuttgart, 1981.Google Scholar
  11. [Sö82]
    U. Schöning. A uniform approach to obtaining diagonal sets in complexity classes. Theor. Comp. Sci. 18, 1982, pp 95–103.CrossRefGoogle Scholar
  12. [Yg83]
    P. Young. Some structural properties of polynomial reducibilities and sets in NP. Proc. 15th ACM Symp., 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Kenneth W. Regan
    • 1
  1. 1.Merton CollegeOxfordUK

Personalised recommendations