2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
type: Item
instance of: scholarly article
title: 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
zbMATH Open document ID: 1256.05146
author: Boaz Barak
author: Anup Rao
author: Ronen Shaltiel
author: A. Wigderson
published in: Annals of Mathematics. Second Series
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 6121647
zbMATH Keywords: dispersers
zbMATH Keywords: extractors
zbMATH Keywords: Ramsey graphs
MaRDI profile type: Publication
full work available at URL: annals.2012.176.3.3
OpenAlex ID: W2160212276
cites work: The Shannon capacity of a union
cites work: Extracting Randomness Using Few Independent Sources
cites work: Simulating independence
cites work: MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
cites work: A sum-product estimate in finite fields, and applications
cites work: Randomness conductors and constant-degree lossless expanders
cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
cites work: Intersection theorems with geometric consequences
cites work: Constructing Ramsey graphs from Boolean function representations
cites work: Low rank co-diagonal matrices and Ramsey graphs
cites work: Better extractors for better codes?
cites work: Extractors
cites work: On data structures and asymmetric communication complexity
cites work: Q5465363
cites work: Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
cites work: Extractors with weak random seeds
cites work: Extracting all the randomness and reducing the error in Trevisan's extractors
cites work: Extracting Randomness via Repeated Condensing
cites work: Generating quasi-random sequences from semi-random sources
cites work: Q3152800
cites work: Extractor Codes
cites work: Extractors and pseudorandom generators
cites work: Expanders that beat the eigenvalue bound: Explicit construction and applications
DOI: 10.4007/ANNALS.2012.176.3.3
Recommended article: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
Recommended article: Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
Recommended article: Two-source dispersers for polylogarithmic entropy and improved ramsey graphs
Recommended article: Towards optimal two-source extractors and Ramsey graphs
Recommended article: Simulating independence
Recommended article: An entropic proof of cutoff on Ramanujan graphs
Recommended article: On the degeneracy of the Randić entropy and related graph measures
Recommended article: A note on the von Neumann entropy of random graphs
Recommended article: The entropy of random-free graphons and properties
description: scientific article; zbMATH DE number 6121647