000 02367nam a22004695i 4500
001 u374891
003 SIRSI
005 20160812084257.0
007 cr nn 008mamaa
008 101013s2011 gw | s |||| 0|eng d
020 _a9783642149030
_9978-3-642-14903-0
040 _cMX-MeUAM
050 4 _aQA75.5-76.95
082 0 4 _a004.0151
_223
100 1 _aGabizon, Ariel.
_eauthor.
245 1 0 _aDeterministic Extraction from Weak Random Sources
_h[recurso electrónico] /
_cby Ariel Gabizon.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2011.
300 _aXII, 148 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x1431-2654
520 _aA 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.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aGeometry, algebraic.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aMathematics of Computing.
650 2 4 _aAlgebraic Geometry.
650 2 4 _aCombinatorics.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642149023
830 0 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x1431-2654
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-14903-0
596 _a19
942 _cLIBRO_ELEC
999 _c202771
_d202771