ZPP ⊆ RP
Statement
Sketch
Replace the output by reject: the machine never accepts a no-instance and accepts a yes-instance with probability at least . For the expected-polynomial-time formulation, first truncate the run at twice the polynomial bound on its expected running time and output on timeout; by Markov’s inequality this happens with probability at most , and every non- answer is correct.
Notes
- Replacing by accept instead gives , and — Gil77.