Random Polynomial Time is Equal to Semi-Random Polynomial Time
Vazirani, Umesh V.; Vazirani, Vijay V.
We prove that any one-sided error random polynomial time (RP) algorithm can be simulated with a semi-random source at no more than polynomial factor loss in efficiency. i.e. RP=SRP. This contrasts with the fact that a semi-random source is too weak to simulate fair coin flips [SV].
computer science; technical report
Previously Published As