Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

29

Voted
FOCS

2000

IEEE

2000

IEEE

Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, the use of extra randomness can be simulated by complete enumeration (alas, at the price of a considerable slow-down), but in other applications (e.g. in cryptography) the use of extra randomness is undesirable. In this paper, we consider the problem of deterministically converting a weak source of randomness into an almost uniform distribution. Previously, deterministic extraction procedures were known only for classes of distributions having strong independence requirement. Under complexity assumptions, we show how to extract randomness from any samplable distribution, i.e. a distribution that can be generated by an efﬁcient sampling algorithm. Assuming that there are problems in E that are not solvable by subexponential-size circuits with 5 gates, we give a polynomial-time extractor that is able to transf...

Related Content

Added |
31 Jul 2010 |

Updated |
31 Jul 2010 |

Type |
Conference |

Year |
2000 |

Where |
FOCS |

Authors |
Luca Trevisan, Salil P. Vadhan |

Comments (0)