论文信息 - Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy

Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy

Abstract By confirming a conjecture of First, Saxe, and Sipser (1981) on the size of constant-depth parity circuits, Yao (1985) has completed the proof that PSPACE is separated from the polynomial-time hierarchy by some oracle. Cai (1986) modified Yao's complex argument to prove that this separation occurs relative to almost every oracle. We prove that this result actually follows immeadiately from Yao's theorem, using a simple construction of Ajtai and Ben-Or (1984) to eliminate randomization in bounded-depth Boolean circuits.

László Babai | L. Babai

[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.