|
|
|
|
| LEADER |
02494nam a22005175i 4500 |
| 001 |
978-3-642-14903-0 |
| 003 |
DE-He213 |
| 005 |
20151204162655.0 |
| 007 |
cr nn 008mamaa |
| 008 |
101013s2011 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642149030
|9 978-3-642-14903-0
|
| 024 |
7 |
|
|a 10.1007/978-3-642-14903-0
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UY
|2 bicssc
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM014000
|2 bisacsh
|
| 072 |
|
7 |
|a COM031000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 100 |
1 |
|
|a Gabizon, Ariel.
|e author.
|
| 245 |
1 |
0 |
|a Deterministic Extraction from Weak Random Sources
|h [electronic resource] /
|c by Ariel Gabizon.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2011.
|
| 300 |
|
|
|a XII, 148 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Monographs in Theoretical Computer Science. An EATCS Series,
|x 1431-2654
|
| 520 |
|
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Algebraic geometry.
|
| 650 |
|
0 |
|a Combinatorics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Mathematics of Computing.
|
| 650 |
2 |
4 |
|a Algebraic Geometry.
|
| 650 |
2 |
4 |
|a Combinatorics.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642149023
|
| 830 |
|
0 |
|a Monographs in Theoretical Computer Science. An EATCS Series,
|x 1431-2654
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-14903-0
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
