Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Deterministic Extraction from Weak Random Sources - Ariel Gabizon

Deterministic Extraction from Weak Random Sources

(Autor)

Buch | Softcover
XII, 148 Seiten
2012 | 2011
Springer Berlin (Verlag)
978-3-642-26538-9 (ISBN)
CHF 169,95 inkl. MwSt
  • Versand in 10-15 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken
In this research monograph, the author constructs deterministic extractors for several types of sources, using a methodology of recycling randomness which enables increasing the output length of deterministic extractors to near optimal length.
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.

IntroductionDeterministic Extractors for Bit-Fixing Sources by Obtaining an Independent SeedDeterministic Extractors for Affine Sources Over Large FieldsExtractors and Rank Extractors for Polynomial SourcesIncreasing the Output Length of Zero-Error DispersersApp. A, Sampling and PartitioningApp. B, Basic Notions from Algebraic GeometryBibliography

From the reviews:

"This monograph is in the European Association for Theoretical Computer Science (EATCS) monograph series. It is an edited version of the author's PhD thesis. ... the book presents probability arguments and methods quite clearly, and in a way that readers can study them separately. Finally, the book contains two very useful appendices, one on probability methods and the other on concepts from algebraic geometry." (Bruce Litow, ACM Computing Reviews, November, 2011)

Erscheint lt. Verlag 1.12.2012
Reihe/Serie Monographs in Theoretical Computer Science. An EATCS Series
Zusatzinfo XII, 148 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 253 g
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Mathematik / Informatik Mathematik Geometrie / Topologie
Mathematik / Informatik Mathematik Graphentheorie
Schlagworte Affine sources • combinatorics • Derandomization • Deterministic extractors • Dispersers • Randomness extractors • Recycling randomness
ISBN-10 3-642-26538-3 / 3642265383
ISBN-13 978-3-642-26538-9 / 9783642265389
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven

von Matthias Homeister

Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
was jeder über Informatik wissen sollte

von Timm Eichstädt; Stefan Spieker

Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
Eine Einführung in die Systemtheorie

von Margot Berghaus

Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95