Deterministic extraction from weak random sources
Ariel GabizonA 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.
Beware of he who would deny you access to information, for in his heart he dreams himself your master
File converter
অনুসন্ধানের আরো ফলাফল
More benefits 
![Alexei Kanel-Belov, Louis Halle Rowen — Computational Aspects of Polynomial Identities: Volume 1, Kemers Theorems: Second Edition [Draft]](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/8d3feb4a0dd18eec9aaabf83d0ac31e9db4ad4b469445cb8ea2d72fbc68e26c6.jpg)
