论文信息 - Probability One Separation of the Boolean Hierarchy

Probability One Separation of the Boolean Hierarchy

As a natural extension of P and NP, the Boolean closure of NP has attracted much attention recently. Many interesting properties of the class BH were discussed in [CH86] and [Wag85].

Jin-Yi Cai

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

[2] Jin-Yi Cai,et al. The Boolean Hierarchy: Hardware over NP , 1986, SCT.

[3] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

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

[5] Jin-Yi Cai,et al. With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[6] Jin-Yi Cai,et al. With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

[7] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .

[8] Gerd Wechsung,et al. On the Boolean closure of NP , 1985, FCT.

[9] Klaus Ambos-Spies,et al. Randomness, Relativizations, and Polynomial Reducibilities , 1986, SCT.

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

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

[12] Stuart A. Kurtz. On the Random Oracle Hypothesis , 1983, Inf. Control..

[13] Gerd Wechsung. More about the closure of NP , 1988 .

[14] Klaus W. Wagner. More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..