000			02217nam a22003615i 4500
001			301095
003			MX-SnUAN
005			20160429155656.0
007			cr nn 008mamaa
008			150903s2011 gw | o |||| 0|eng d
020			_a9783642149030 _99783642149030
024	7		_a10.1007/9783642149030 _2doi
035			_avtls000355552
039		9	_a201509030958 _bVLOAD _c201405060352 _dVLOAD _y201402191046 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA75.5-76.95
100	1		_aGabizon, Ariel. _eautor _9338810
245	1	0	_aDeterministic Extraction from Weak Random Sources / _cby Ariel Gabizon.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2011.
300			_axii, 148 páginas _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aMonographs in Theoretical Computer Science. An EATCS Series, _x1431-2654
500			_aSpringer eBooks
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.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783642149023
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-14903-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c301095 _d301095