On diagonalization methods and the structure of language classes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)
KeywordsRecursive 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.
- [HU79]J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, And Computation. (Reading, Mass: Addison-Wesley 1979)Google Scholar
- [Kz80]D. Kozen. Indexings of subrecursive classes. Theoretical Computer Science 11, 1980, pp 277–301.Google Scholar
- [Lad75]R. Ladner. On the structure of polynomial-time reducibility. J. ACM 22, 1975, pp 155–171.Google Scholar
- [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
- [Re82]K. Regan. Computability, enumerability, and the polynomial hierarchy. M.Sc. qualifying dissertation, Oxford, 1982.Google Scholar
- [Re83]K. Regan. Arithmetical degrees of index sets for complexity classes. Draft, in preparation for submission to TCS in 1983.Google Scholar
- [Rog67]H. Rogers. Theory of Recursive Functions and Effective Computability. (New York: McGraw-Hill, 1967).Google Scholar
- [Sö81]U. Schöning. Untersuchungen zur Struktur von NP... Ph.D. dissertation, Stuttgart, 1981.Google Scholar
- [Yg83]P. Young. Some structural properties of polynomial reducibilities and sets in NP. Proc. 15th ACM Symp., 1983.Google Scholar
© Springer-Verlag Berlin Heidelberg 1983