Cargando…
Deterministic Extraction from Weak Random Sources
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 increa...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2011.
|
| Edición: | 1st ed. 2011. |
| Colección: | Monographs in Theoretical Computer Science. An EATCS Series,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-14903-0 | ||
| 003 | DE-He213 | ||
| 005 | 20220120075308.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 | |
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Gabizon, Ariel. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Deterministic Extraction from Weak Random Sources |h [electronic resource] / |c by Ariel Gabizon. |
| 250 | |a 1st ed. 2011. | ||
| 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 2193-2069 | |
| 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 Computer science-Mathematics. | |
| 650 | 0 | |a Algebraic geometry. | |
| 650 | 0 | |a Discrete mathematics. | |
| 650 | 1 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Mathematics of Computing. |
| 650 | 2 | 4 | |a Algebraic Geometry. |
| 650 | 2 | 4 | |a Discrete Mathematics. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783642265389 |
| 776 | 0 | 8 | |i Printed edition: |z 9783642149023 |
| 776 | 0 | 8 | |i Printed edition: |z 9783642149047 |
| 830 | 0 | |a Monographs in Theoretical Computer Science. An EATCS Series, |x 2193-2069 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-3-642-14903-0 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||