Deterministic Extraction from Weak Random Sources
Gabizon, Ariel.
Deterministic Extraction from Weak Random Sources [recurso electrónico] / by Ariel Gabizon. - XII, 148 p. online resource. - Monographs in Theoretical Computer Science. An EATCS Series, 1431-2654 . - Monographs in Theoretical Computer Science. An EATCS Series, .
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.
9783642149030
Computer science.
Information theory.
Geometry, algebraic.
Combinatorics.
Computer Science.
Theory of Computation.
Mathematics of Computing.
Algebraic Geometry.
Combinatorics.
QA75.5-76.95
004.0151
Deterministic Extraction from Weak Random Sources [recurso electrónico] / by Ariel Gabizon. - XII, 148 p. online resource. - Monographs in Theoretical Computer Science. An EATCS Series, 1431-2654 . - Monographs in Theoretical Computer Science. An EATCS Series, .
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.
9783642149030
Computer science.
Information theory.
Geometry, algebraic.
Combinatorics.
Computer Science.
Theory of Computation.
Mathematics of Computing.
Algebraic Geometry.
Combinatorics.
QA75.5-76.95
004.0151
