A decisive characterization of BPP
Information and Control
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
Probabilistic quantifiers vs. distrustful adversaries
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
More on BPP and the polynomial-time hierarchy
Information Processing Letters
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Symmetric alternation captures BPP
Computational Complexity
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
Stronger methods of making quantum interactive proofs perfectly complete
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.01 |
We provide another proof of the Sipser-Lautemann Theorem by which BPP ⊆ MA (⊆ PH). The current proof is based on strong results regarding the amplification of BPP, due to Zuckerman (1996). Given these results, the current proof is even simpler than previous ones. Furthermore, extending the proof leads to two results regarding MA: MA ⊆ ZPPNP (which seems to be new), and that two-sided error MA equals MA. Finally, we survey the known facts regarding the fragment of the polynomial-time hierarchy that contains MA.