Random Polynomial Time is Equal to Semi-Random Polynomial Time

Thumbnail
View/Open
PERMANENT LINK(S)
http://hdl.handle.net/1813/6799
Collections
Metadata
Show full item record
Author
Vazirani, Umesh V.; Vazirani, Vijay V.
Abstract
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].
Date Issued
1988-12
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-959
Type
technical report

Statistics