Sparse sets in NP-P: Exptime versus nexptime
暂无分享,去创建一个
[1] Stephen A. Cook,et al. A hierarchy for nondeterministic time complexity , 1972, J. Comput. Syst. Sci..
[2] Oscar H. Ibarra. A Note Concerning Nondeterministic Tape Complexities , 1972, JACM.
[3] Stephen A. Cook. A Hierarchy for Nondeterministic Time Complexity , 1973, J. Comput. Syst. Sci..
[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[5] Ronald V. Book,et al. Tally Languages and Complexity Classes , 1974, Inf. Control..
[6] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[7] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.
[8] Juris Hartmanis,et al. On isomorphisms and density of NP and other complete sets , 1976, STOC '76.
[9] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[10] Joel I. Seiferas. Techniques for Separating Space Complexity Classes , 1977, J. Comput. Syst. Sci..
[11] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..
[12] Dexter Kozen,et al. Indexing of subrecursive classes , 1978, STOC.
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] Dexter Kozen,et al. Indexings of Subrecursive Classes , 1980, Theor. Comput. Sci..
[15] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[16] 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).
[17] Ronald V. Book,et al. Relativizing time and space , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[18] Juris Hartmanis. On Sparse Sets in NP - P , 1983, Inf. Process. Lett..