One-sided Versus Two-sided Error in Probabilistic Computation

We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simpli es the proofs of the later result due to Andreev, Clementi and Rolim and Andreev, Clementi, Rolim and Trevisan. Clementi, Rolim and Trevisan question whether the promise is necessary for the above results, i.e., whether BPP RPRP for instance. We give a relativized world where P = RP 6= BPP and thus the promise is indeed needed.

• Type: Conference
• Year: 1999
• Where: STACS
• Authors: Harry Buhrman, Lance Fortnow
• Keywords: BPP RPRP, Hitting Set Generators, Lautemann's Proof, STACS 1999, Theoretical Computer Science