首页 | 本学科首页   官方微博 | 高级检索  
     


Arthur and Merlin as Oracles
Authors:Venkatesan T Chakaravarthy  Sambuddha Roy
Affiliation:1. IBM Research Lab, New Delhi, India
Abstract:We study some problems solvable in deterministic polynomial time given oracle access to the (promise version of) Arthur–Merlin class. Our main results are the following:
°   BPPNP|| í PprAM||.\circ\quad{\rm BPP}^{{\rm NP}}_{||} \subseteq {{\rm P}^{{{\rm pr}{\rm AM}}}_{||}}.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号