The strong exponential hierarchy collapses
暂无分享,去创建一个
[1] Alan L. Selman,et al. Qualitative Relativizations of Complexity Classes , 1985, J. Comput. Syst. Sci..
[2] L. Hemachandra,et al. Counting in structural complexity theory , 1987 .
[3] Klaus W. Wagner,et al. Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries , 1988, STACS.
[4] Juris Hartmanis,et al. The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..
[5] Neil Immerman,et al. Nondeterministic space is closed under complementation , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[6] Juris Hartmanis,et al. Complexity Classes without Machines: On Complete Languages for UP , 1988, Theor. Comput. Sci..
[7] Stathis Zachos,et al. Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview , 1986, SCT.
[8] Klaus-Jörn Lange,et al. The Logarithmic Alternation Hierarchy Collapses: A∑2L = A∏2L , 1989, Inf. Comput..
[9] Seinosuke Toda. Sigma_2 SPACE(n) is Closed under Complement , 1987, J. Comput. Syst. Sci..
[10] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..
[11] Timothy J. Long,et al. Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..
[12] C. Papadimitriou,et al. Two remarks on the power of counting , 1983 .
[13] Lane A. Hemachandra. Can P and NP Manufacture Randomness , 1986 .
[14] Juris Hartmanis,et al. The Boolean Hierarchy II: Applications , 1989, SIAM J. Comput..
[15] Yaacov Yesha. On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets , 1983, SIAM J. Comput..
[16] Peter Clote,et al. Exponential Time and Bounded Arithmetic , 1986, SCT.
[17] Timothy J. Long. Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles , 1988, SIAM J. Comput..
[18] Juris Hartmanis,et al. On Sparse Oracles Separating Feasible Complexity Classes , 1988, Inf. Process. Lett..
[19] Samuel R. Buss,et al. On truth-table reducibility to SAT and the difference hierarchy over NP , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[20] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[21] Klaus W. Wagner,et al. Bounded query computations , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.
[22] Ronald V. Book,et al. Positive Relativizations of Complexity Classes , 1983, SIAM J. Comput..
[23] J. Hartmanis,et al. Computation Times of NP Sets of Different Densities , 1984, Theor. Comput. Sci..
[24] Lane A. Hemachandra. The Sky is Falling: The Strong Exponential Hierarchy Collapses , 1986 .
[25] R.E. Ladner,et al. A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..
[26] Ronald V. Book,et al. Bounded Query Machines: On NP and PSPACE , 1981, Theor. Comput. Sci..
[27] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[28] Neil Immerman,et al. Sparse Sets in NP-P: EXPTIME versus NEXPTIME , 1985, Inf. Control..
[29] Juris Hartmanis. Solvable problems with conflicting relativizations , 1985, Bull. EATCS.
[30] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[31] Klaus W. Wagner,et al. The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..
[32] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[33] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..
[34] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .