首页> 外文期刊>Electronic Colloquium on Computational Complexity >Another proof that BPP subseteq PH (and more).
【24h】

Another proof that BPP subseteq PH (and more).

机译:另一个证明BPPsubseteq PH(以及更多)。

获取原文
           

摘要

We provide another proof of the Sipser--Lautemann Theorem by which BPPMA (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: MAZPPNP (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 which contains MA.
机译:我们提供了BPPMA(PH)的Sipser-Lautemann定理的另一个证明。扎克曼(Zuckerman)提出的最新证据是基于有关BPP扩增的强大结果。鉴于这些结果,当前的证明甚至比以前的证明更简单。此外,扩展证明会导致关于MA的两个结果:MAZPPNP(这似乎是新的),并且双向误差MA等于MA。最后,我们调查有关包含MA的多项式时间层次结构片段的已知事实。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号