Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy
暂无分享,去创建一个
[1] Bruno Poizat,et al. $\mathscr{L} = \mathscr{N} \mathscr{L}$? , 1986 .
[2] Michael Sipser,et al. Borel sets and circuit complexity , 1983, STOC.
[3] Stuart A. Kurtz,et al. On the random oracle hypothesis , 1982, STOC '82.
[4] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[5] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..
[6] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[7] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[8] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.
[9] Michael Ben-Or,et al. A theorem on probabilistic constant depth Computations , 1984, STOC '84.