## Simulating BPP Using a General Weak Random Source (1996)

by
David Zuckerman

Venue: | ALGORITHMICA |

Citations: | 105 - 18 self |

### BibTeX

@ARTICLE{Zuckerman96simulatingbpp,

author = {David Zuckerman},

title = {Simulating BPP Using a General Weak Random Source},

journal = {ALGORITHMICA},

year = {1996},

volume = {16},

pages = {79--89}

}

### Years of Citing Articles

### OpenURL

### Abstract

We show how to simulate BPP and approximation algorithms in polynomial time using the output from a ffi-source. A ffi-source is a weak random source that is asked only once for R bits, and must output an R-bit string according to some distribution that places probability no more than 2 \GammaffiR on any particular string. We also give an application to the unapproximability of Max Clique.