Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft GLS point 1 390 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 790 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Deterministic Extraction from Weak Random Sources

Name: Deterministic Extraction from Weak Random Sources
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 02108395
Price: 39688 HUF
Availability: InStock
Author: Ariel Gabizon
ISBN: 9783642149023

Ariel Gabizon

Language

English

Book Hardback

Libristo code: 02108395

Publishers Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, October 2010

A deterministic extractor is a function that extracts almost perfect random bits from a weak random... Full description

Libristo code: 02108395

271 b

39 688 Ft

In stock at our supplier Shipping in 10-13 days

30-day return policy

Customers also purchased

Posel Andrea Fischerová

Paperback

2 930 Ft

Keiner halt Don Carlo auf Oliver Scherz

Hardback

4 571 Ft

#informatik Studium Eat. Sleep. Program. Repeat.: A5 Geschenkbuch KARIERT für Informatik Studenten - Programmierer - Geschenkidee Abitur Schulabschlus Informatik Studium

Paperback

3 018 Ft

SHIFUMI

Toy

4 354 Ft

Die Brooklyn-Revue Paul Auster

Paperback

5 616 Ft

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.