Another proof that BPP subseteq PH (and more).

Electronic Colloquium on Computational Complexity (ECCC)(1997)

引用 96|浏览13
暂无评分
摘要
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.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 benew), and that two-sided error MA equals MA. Finally, we survey the known facts regardingthe fragment of the polynomial-time hierarchy...
更多
查看译文
关键词
polynomial time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要