73,95 €
73,95 €
inkl. MwSt.
Sofort per Download lieferbar
37 °P sammeln
73,95 €
Als Download kaufen
73,95 €
inkl. MwSt.
Sofort per Download lieferbar
37 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
73,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
37 °P sammeln
Andere Kunden interessierten sich auch für
![Geometric Algebra: An Algebraic System for Computer Games and Animation (eBook, PDF)]( "Geometric Algebra: An Algebraic System for Computer Games and Animation (eBook, PDF)")
Geometric Algebra: An Algebraic System for Computer Games and Animation (eBook, PDF)48,95 €![Algebraic Cryptanalysis (eBook, PDF)]( "Algebraic Cryptanalysis (eBook, PDF)")
Algebraic Cryptanalysis (eBook, PDF)193,95 €![Patterns in Permutations and Words (eBook, PDF)]( "Patterns in Permutations and Words (eBook, PDF)")
Patterns in Permutations and Words (eBook, PDF)113,95 €![Mechanical Theorem Proving in Geometries (eBook, PDF)]( "Mechanical Theorem Proving in Geometries (eBook, PDF)")
Mechanical Theorem Proving in Geometries (eBook, PDF)40,95 €![Algorithms in Invariant Theory (eBook, PDF)]( "Algorithms in Invariant Theory (eBook, PDF)")
Algorithms in Invariant Theory (eBook, PDF)105,95 €![Algorithmic Algebra and Number Theory (eBook, PDF)]( "Algorithmic Algebra and Number Theory (eBook, PDF)")
Algorithmic Algebra and Number Theory (eBook, PDF)73,95 €![Quantifier Elimination and Cylindrical Algebraic Decomposition (eBook, PDF)]( "Quantifier Elimination and Cylindrical Algebraic Decomposition (eBook, PDF)")
Quantifier Elimination and Cylindrical Algebraic Decomposition (eBook, PDF)40,95 €
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.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
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)