Cantitate/Preț
Produs
Total produse
Vezi coșul
Deterministic Extraction from Weak Random Sources de Ariel Gabizon

Deterministic Extraction from Weak Random Sources: Monographs in Theoretical Computer Science. An EATCS Series

Autor Ariel Gabizon
en Limba Engleză Paperback – dec 2012
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 58340 lei  39-44 zile
  Springer Berlin, Heidelberg – dec 2012 58340 lei  39-44 zile
Hardback (1) 59327 lei  39-44 zile
  Springer Berlin, Heidelberg – 8 oct 2010 59327 lei  39-44 zile

Din seria Monographs in Theoretical Computer Science. An EATCS Series

Preț: 58340 lei

Preț vechi: 72925 lei
-20% Nou

Puncte Express: 875
Preț estimativ în valută:
11166€ • 11779$ • 9305£

Carte tipărită la comandă

Livrare economică 30 decembrie 24 - 04 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642265389
ISBN-10: 3642265383
Pagini: 160
Ilustrații: XII, 148 p.
Dimensiuni: 155 x 235 x 8 mm
Greutate: 0.24 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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

Recenzii

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)

Textul de pe ultima copertă

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.

Caracteristici

First complete treatment of the topic Introduces new results Results introduced will impact on various disciplines Includes supplementary material: sn.pub/extras