Description 
1 online resource (xi, 148 pages) 
Series 
Monographs in theoretical computer science 

Monographs in theoretical computer science.

Contents 
Deterministic Extractors for BitFixing 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 ZeroError Dispersers 
Summary 
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 bitfixing sources, deterministic extractors for affine sources and polynomial sources over large fields, and increasing the output length of zeroerror dispersers. This work will be of interest to researchers and graduate students in combinatorics and theoretical computer science 
Bibliography 
Includes bibliographical references 
Notes 
English 

Print version record 
Subject 
Geometry, Algebraic.


MATHEMATICS  Probability & Statistics  Stochastic Processes.


Informatique.


Geometry, Algebraic.


Zufallsgenerator

Form 
Electronic book

ISBN 
9783642149030 

3642149030 
