Explicit Two-Source Extractors and Resilient Functions
STOC '16: Symposium on Theory of Computing Cambridge MA USA June, 2016, pp. 670-683, 2016.
Randomness ExtractorPseudorandomnessTwo-Source ExtractorResilient FunctionRamsey graph
We explicitly construct an extractor for two independent sources on n bits, each with polylogarithmic min-entropy. Our extractor outputs one bit and has polynomially small error. The best previous extractor, by Bourgain, required each source to have min-entropy .499n. A key ingredient in our construction is an explicit construction of...More
Full Text (Upload PDF)
PPT (Upload PPT)
Best Paper of STOC, 2016