Deterministic Extraction from Weak Random Sources [electronic resource] /by Ariel Gabizon.
by Gabizon, Ariel [author.]; SpringerLink (Online service).
Material type:
BookSeries: Monographs in Theoretical Computer Science. An EATCS Series: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : 2011.Description: XII, 148 p. online resource.ISBN: 9783642149030.Subject(s): Computer science | Information theory | Geometry, algebraic | Combinatorics | Computer Science | Theory of Computation | Mathematics of Computing | Algebraic Geometry | CombinatoricsDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
| Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA75.5-76.95 (Browse shelf) | Available |
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.
There are no comments for this item.