A deterministic extractor is a function that extracts almost perfect random bits from a weak random source. In this research monograph the author constructs deterministic extractors for several types of sources. A basic theme in this work is a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length. The author's main work examines deterministic extractors for bit-fixing sources, deterministic extractors for affine sources and polynomial sources over large fields, and increasing the output length of zero-error dispersers. This work will be of interest to researchers and graduate students in combinatorics and theoretical computer science.
| Autorius: | Ariel Gabizon |
| Serija: | Monographs in Theoretical Computer Science. An EATCS Series |
| Leidėjas: | Springer Berlin Heidelberg |
| Išleidimo metai: | 2010 |
| Knygos puslapių skaičius: | 160 |
| ISBN-10: | 3642149022 |
| ISBN-13: | 9783642149023 |
| Formatas: | Knyga kietu viršeliu |
| Kalba: | Anglų |
| Žanras: | Algebraic geometry |
Parašykite atsiliepimą apie „Deterministic Extraction from Weak Random Sources“
