Chapter

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Volume 3624 of the series Lecture Notes in Computer Science pp 294-305

On the Error Parameter of Dispersers

  • Ronen GradwohlAffiliated withCarnegie Mellon UniversityDepartment of Computer Science and Applied Math, Weizmann Institute of Science
  • , Guy KindlerAffiliated withCarnegie Mellon UniversityInstitute for Advanced Study
  • , Omer ReingoldAffiliated withCarnegie Mellon UniversityDepartment of Computer Science and Applied Math, Weizmann Institute of Science
  • , Amnon Ta-ShmaAffiliated withCarnegie Mellon UniversitySchool of Computer Science, Tel-Aviv University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.