On the Error Parameter of Dispersers

Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in some parameters. Our constructions are not strong, but we show that having such explicit strong constructions implies a sol...

Full description

Saved in:
Bibliographic Details
Published inApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques pp. 294 - 305
Main Authors Gradwohl, Ronen, Kindler, Guy, Reingold, Omer, Ta-Shma, Amnon
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2005
Springer
SeriesLecture Notes in Computer Science
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Bipartite Graph
Computer science; control theory; systems
Constant Error
Error Parameter
Error Reduction
Exact sciences and technology
Explicit Construction
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Theoretical computing
Randomization
Graph construction
Beat
Graph theory
Extractor
Combinatorial optimization
Strong solution
Modeling
Online AccessGet full text

Cover

More Information
Summary:Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in some parameters. Our constructions are not strong, but we show that having such explicit strong constructions implies a solution to the Ramsey graph construction problem.
ISBN:9783540282396
3540282394
ISSN:0302-9743
1611-3349
DOI:10.1007/11538462_25