Deterministic Extraction from Weak Random Sources

• Κύριος συγγραφέας: Gabizon, Ariel (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
• Σειρά: Monographs in Theoretical Computer Science. An EATCS Series,
• Θέματα: Computer science.; Computers.; Computer science > Mathematics.; Algebraic geometry.; Combinatorics.; Computer Science.; Theory of Computation.; Mathematics of Computing.; Algebraic Geometry.
• Φυσική περιγραφή: XII, 148 p. online resource.
• ISBN: 9783642149030
• ISSN: 1431-2654

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.