Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
From MaRDI portal
Publication:5361836
DOI10.1145/2897518.2897530zbMath1376.05086arXiv1506.04428OpenAlexW2963473071MaRDI QIDQ5361836
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.04428
Related Items (12)
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture ⋮ Unnamed Item ⋮ Induced Subgraphs With Many Distinct Degrees ⋮ Quasi chain rule for min-entropy ⋮ Unnamed Item ⋮ An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs ⋮ Unnamed Item ⋮ Multi-source non-malleable extractors and applications ⋮ Explicit two-source extractors and resilient functions ⋮ Proof of a conjecture on induced subgraphs of Ramsey graphs ⋮ Large cliques and independent sets all over the place
This page was built for publication: Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
