Abstract
Extractors are functions which are able to “extract” random bits from arbitrary distributions which “contain” sufficient randomness. Explicit constructions of extractors have many applications in complexity theory and combinatorics.
This manuscript is a survey of recent developments in extractors and focuses on explicit constructions of extractors following Trevisan’s breakthrough result [Tre99].
This manuscript is a survey of recent developments in extractors and focuses on explicit constructions of extractors following Trevisan’s breakthrough result [Tre99].
| Original language | English |
|---|---|
| Title of host publication | Invited survey paper |
| Editors | Lance Fortnow |
| Publisher | EATCS |
| Pages | 67-95 |
| State | Published - 2002 |
Fingerprint
Dive into the research topics of 'Recent developments in explicit constructions of extractors'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver