Random Polynomial Time is Equal to Semi-Random Polynomial Time

Authors:
Umesh V. Vazirani;Vijay V. Vazirani
Affiliations:
-;-
Venue:
Random Polynomial Time is Equal to Semi-Random Polynomial Time
Year:
1988

Citing 0
Cited 3

Explicit dispersers with polylog degree

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Explicit OR-dispersers with polylogarithmic degree

Journal of the ACM (JACM)
Deterministic Extractors for Affine Sources over Large Fields

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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].