Optimal dispersere 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.
|Number of pages||12|
|Journal||Lecture Notes in Computer Science|
|State||Published - 2005|
|Event||8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th International Workshop on Randomization and Computation, RANDOM 2005 - Berkeley, CA, United States|
Duration: 22 Aug 2005 → 24 Aug 2005