Andere Kunden interessierten sich auch für
![Deterministic Extraction from Weak Random Sources]( "Deterministic Extraction from Weak Random Sources")
Deterministic Extraction from Weak Random Sources74,99 €![Randomness and Completeness in Computational Complexity]( "Randomness and Completeness in Computational Complexity")
Randomness and Completeness in Computational Complexity37,99 €![Random Number Generation and Monte Carlo Methods]( "Random Number Generation and Monte Carlo Methods")
Random Number Generation and Monte Carlo Methods149,99 €![Mechanics of Random and Multiscale Microstructures]( "Mechanics of Random and Multiscale Microstructures")
Mechanics of Random and Multiscale Microstructures74,99 €![Patterns in Permutations and Words]( "Patterns in Permutations and Words")
Patterns in Permutations and Words110,99 €![Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques]( "Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques")
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques77,99 €![Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques]( "Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques")
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques39,99 €
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.
From the reviews: "This monograph is in the European Association for Theoretical Computer Science (EATCS) monograph series. It is an edited version of the author's PhD thesis. ... the book presents probability arguments and methods quite clearly, and in a way that readers can study them separately. Finally, the book contains two very useful appendices, one on probability methods and the other on concepts from algebraic geometry." (Bruce Litow, ACM Computing Reviews, November, 2011)