Venkatesan Chakaravarthy, Sambuddha Roy

We study some problems solvable in deterministic polynomial time given oracle access to the (promise version of) the Arthur-Merlin class.

Our main results are the following: (i) $BPP^{NP}_{||} \subseteq P^{prAM}_{||}$; (ii) $S_2^p \subseteq P^{prAM}$. In addition to providing new upperbounds for the classes $S_2^p$ and $BPP^{NP}_{||}$, these results are interesting ...
more >>>