Containment, Separation, Complete Sets, and Immunity of Complexity Classes

[1]  Juris Hartmanis.  New Developments in Structural Complexity Theory , 1990, Theor. Comput. Sci..

[2]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[3]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1986, Theor. Comput. Sci..

[4]  Juris Hartmanis,et al.  On Sparse Oracles Separating Feasible Complexity Classes , 1986, STACS.

[5]  Steven Homer.  On Simple and Creative Sets in NP , 1986, Theor. Comput. Sci..

[6]  Neil Immerman,et al.  On Complete Problems for NP$\cap$CoNP , 1985, ICALP.

[7]  Ming Li.  Lower bounds in Computational Complexity , 1985 .

[8]  Neil Immerman,et al.  Sparse sets in NP-P: Exptime versus nexptime , 1983, Inf. Control..

[9]  Wojciech Kowalczyk,et al.  Some Connections between Representability of Complexity Classes and the Power of Formal Systems of Reasoning , 1984, MFCS.

[10]  Yaacov Yesha.  On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets , 1983, SIAM J. Comput..

[11]  J. Hartmanis,et al.  Computation Times of NP Sets of Different Densities , 1984, Theor. Comput. Sci..

[12]  Juris Hartmanis.  On Sparse Sets in NP - P , 1983, Inf. Process. Lett..

[13]  Uwe Schöning.  A Uniform Approach to Obtain Diagonal Sets in Complexity Classes , 1982, Theor. Comput. Sci..

[14]  Joel I. Seiferas,et al.  Limitations on Separating Nondeterministic Complexity Classes , 1981, SIAM J. Comput..

[15]  Richard J. Lipton,et al.  On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..

[16]  George Kossoff,et al.  “The King is Dead, Long Live the King” , 1980 .

[17]  Stephen R. Mahaney.  Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[18]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[19]  Michael J. Fischer,et al.  Separating Nondeterministic Time Complexity Classes , 1978, JACM.

[20]  Leonard Berman,et al.  On the structure of complete sets: Almost everywhere complexity and infinitely often speedup , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[21]  Juris Hartmanis,et al.  On the Structure of Feasible Computations , 1976, Adv. Comput..

[22]  Nancy A. Lynch,et al.  On Reducibility to Complex or Sparse Sets , 1975, JACM.

[23]  Ronald V. Book,et al.  Tally Languages and Complexity Classes , 1974, Inf. Control..

[24]  Nancy A. Lynch,et al.  Comparison of polynomial-time reducibilities , 1974, STOC '74.

[25]  Stephen A. Cook,et al.  A hierarchy for nondeterministic time complexity , 1972, J. Comput. Syst. Sci..

[26]  N. A. Lynch.  RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY , 1972 .

[27]  Sheila A. Greibach,et al.  Time- and Tape-Bounded Turing Acceptors and AFLs , 1970, J. Comput. Syst. Sci..