On the Error Parameter of Dispersers

  • Ronen Gradwohl
  • Guy Kindler
  • Omer Reingold
  • Amnon Ta-Shma
Conference paper

DOI: 10.1007/11538462_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3624)
Cite this paper as:
Gradwohl R., Kindler G., Reingold O., Ta-Shma A. (2005) On the Error Parameter of Dispersers. In: Chekuri C., Jansen K., Rolim J.D.P., Trevisan L. (eds) Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science, vol 3624. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ronen Gradwohl
    • 1
  • Guy Kindler
    • 2
  • Omer Reingold
    • 1
  • Amnon Ta-Shma
    • 3
  1. 1.Department of Computer Science and Applied MathWeizmann Institute of Science 
  2. 2.Institute for Advanced StudyPrinceton
  3. 3.School of Computer ScienceTel-Aviv University 

Personalised recommendations