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 等数据库收录! |
|