E-Book, Englisch, 148 Seiten, eBook
Reihe: Monographs in Theoretical Computer Science. An EATCS Series
Gabizon Deterministic Extraction from Weak Random Sources
1. Auflage 2010
ISBN: 978-3-642-14903-0
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 148 Seiten, eBook
Reihe: Monographs in Theoretical Computer Science. An EATCS Series
ISBN: 978-3-642-14903-0
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Introduction
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed
Deterministic Extractors for Affine Sources Over Large Fields
Extractors and Rank Extractors for Polynomial Sources
Increasing the Output Length of Zero-Error Dispersers
App. A, Sampling and Partitioning
App. B, Basic Notions from Algebraic Geometry
Bibliography
