Quantitative Relativizations of Complexity Classes
暂无分享,去创建一个
[1] John Gill,et al. Polynomial reducibilities and upward diagonalizations , 1977, STOC '77.
[2] Neil D. Jones,et al. Turing machines and the spectra of first-order formulas , 1974, Journal of Symbolic Logic.
[3] Nancy A. Lynch. Log Space Machines with Multiple Oracle Tapes , 1978, Theor. Comput. Sci..
[4] Ronald V. Book,et al. Positive Relativizations of Complexity Classes , 1983, SIAM J. Comput..
[5] Ronald V. Book,et al. Bounded Query Machines: On NP( ) and NPQERY( ) , 1981, Theor. Comput. Sci..
[6] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[7] Timothy J. Long. Strong Nondeterministic Polynomial-Time Reducibilities , 1982, Theor. Comput. Sci..
[8] Theodore P. Baker,et al. A second step toward the polynomial hierarchy , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[9] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..
[10] Ronald V. Book,et al. Bounded Query Machines: On NP and PSPACE , 1981, Theor. Comput. Sci..
[11] Dexter Kozen,et al. Indexings of Subrecursive Classes , 1980, Theor. Comput. Sci..
[12] Istvan Simon. On some subrecursive reducibilities , 1977 .
[13] Ronald V. Book,et al. Relativizing Time, Space, and Time-Space , 1982, SIAM J. Comput..
[14] Michael Sipser,et al. On Relativization and the Existence of Complete Sets , 1982, International Colloquium on Automata, Languages and Programming.
[15] R.E. Ladner,et al. A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..
[16] Juris Hartmanis. On Sparse Sets in NP - P , 1983, Inf. Process. Lett..
[17] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..