Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Complexity and structure
The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
Relativizing complexity classes with sparse oracles
Journal of the ACM (JACM)
A decisive characterization of BPP
Information and Control
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Probabilistic quantifiers, adversaries, and complexity classes: an overview
Proc. of the conference on Structure in complexity theory
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
Random oracles separate PSPACE from the polynomial-time hierarchy
Information Processing Letters
Are there interactive protocols for CO-NP languages?
Information Processing Letters
Relativized Arthur-Merlin versus Merlin-Arthur games
Information and Computation
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Relativized polynomial time hierarchies having exactly K levels
SIAM Journal on Computing
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Relativized Questions Involving Probabilistic Algorithms
Journal of the ACM (JACM)
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Collapsing recursive oracles for relativized polynomial hierarchies
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
The probabilistic polynomial-time hierarchy (BPH) is the hierarchy generated by applying the BP-operator to the Meyer-Stockmeyer polynomial-time hierarchy (PH), where the BP-operator is the natural generalization of the probabilistic complexity class BPP. The similarity and difference between the two hierarchies BPH and PH is investigated. Oracles A and B are constructed such that both PH(A) and PH(B) are infinite while BPH(A) is not equal to PH(A) at any level and BPH(B) is identical to PH(B) at every level. Similar separating and collapsing results in the case that PH(A) is finite having exactly k levels are also considered.