Simulating BPP using a general weak random source

@article{Zuckerman1996SimulatingBU,
  title={Simulating BPP using a general weak random source},
  author={David Zuckerman},
  journal={Algorithmica},
  year={1996},
  volume={16},
  pages={367-391}
}
We show how to simulate BPP and approximation algorithms in polynomial time using the output from a δ-source. A δ-source is a weak random source that is asked only once forR bits, and must output anR-bit string according to some distribution that places probability no more than 2−δR on any particular string. We also give an application to the unapproximability of MAX CLIQUE. 

Similar Papers

Loading similar papers…