The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses

It is shown that if the Boolean hierarchy (BH) collapses, then there exists a sparse set S such that ${\text{co-NP}} \subseteq {\text{ NP}}^S $, and therefore the polynomial time hierarchy (PH) col...

[1]  Jin-Yi Cai,et al.  Graph Minimal Uncolorability is D^P-Complete , 1987, SIAM J. Comput..

[2]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[3]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[4]  Klaus W. Wagner,et al.  Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries , 1988, STACS.

[5]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[6]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[7]  Jim Kadin,et al.  P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..

[8]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

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

[10]  L. Hemachandra.  The strong exponential hierarchy collapses , 1987, STOC 1987.

[11]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[12]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[13]  Mark W. Krentel.  The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[14]  Timothy J. Long,et al.  A Note on Sparse Oracles for NP , 1982, J. Comput. Syst. Sci..

[15]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[16]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[17]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..