2-Source dispersers for sub-polynomial entropy and ramsay graphs beating the frankl-wilson construction

Boaz Barak, Anup Rao, Ronen Shaltiel, Avi Wigderson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The main result of this paper is an explicit disperser for two independent sources on n bits, each of entropy k = no(1). Put differently, setting N = T and K = 2 n, we construct explicit N × N Boolean matrices for which no K × K submatrix is monochromatic. Viewed as adjacency matrices of bipartite graphs, this gives an explicit construction of K-Ramsey bipartite graphs of size N. This greatly improves the previous bound of k = o(n) of Barak, Kindler, Shaltiel, Sudakov and Wigderson [4]. It also significantly improves the 25-year record of k = Õ(√n) on the special case of Ramsey graphs, due to Frankl and Wilson [9]. The construction uses (besides "classical" extractor ideas) almost all of the machinery developed in the last couple of years for extraction from independent sources, including: Bourgain's extractor for 2 independent sources of some entropy rate < 1/2 [5] Raz's extractor for 2 independent sources, one of which has any entropy rate > 1/2 [18] Rao's extractor for 2 independent block-sources of entropy n Ω(1) [17] The "Challenge-Response" mechanism for detecting "entropy concentration" of [4]. The main novelty comes in a bootstrap procedure which allows the Challenge-Response mechanism of [4] to be used with sources of less and less entropy, using recursive calls to itself. Subtleties arise since the success of this mechanism depends on restricting the given sources, and so recursion constantly changes the original sources. These are resolved via a new construct, in between a disperser and an extractor, which behaves like an extractor on sufficiently large subsources of the given ones. This version is only an extended abstract, please see the full version, available on the authors' homepages, for more details.

Original languageEnglish
Title of host publicationSTOC'06
Subtitle of host publicationProceedings of the 38th Annual ACM Symposium on Theory of Computing
Number of pages10
StatePublished - 2006
Event38th Annual ACM Symposium on Theory of Computing, STOC'06 - Seattle, WA, United States
Duration: 21 May 200623 May 2006

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Conference38th Annual ACM Symposium on Theory of Computing, STOC'06
Country/TerritoryUnited States
CitySeattle, WA


  • Dispersers
  • Extractors
  • Independent Sources
  • Ramsey Graphs

ASJC Scopus subject areas

  • Software


Dive into the research topics of '2-Source dispersers for sub-polynomial entropy and ramsay graphs beating the frankl-wilson construction'. Together they form a unique fingerprint.

Cite this