Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
From MaRDI portal
Publication:4997309
DOI10.1137/16M1096219zbMath1467.05168WikidataQ126979500 ScholiaQ126979500MaRDI QIDQ4997309
Publication date: 29 June 2021
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing Ramsey graphs from Boolean function representations
- Intersection theorems with geometric consequences
- The Shannon capacity of a union
- 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction
- Low rank co-diagonal matrices and Ramsey graphs
- Chain Rules for Smooth Min- and Max-Entropies
- Local Correlation Breakers and Applications to Three-Source Extractors and Mergers
- Increasing the Output Length of Zero-Error Dispersers
- A 2-Source Almost-Extractor for Linear Entropy
- Extractors with weak random seeds
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- A note on constructive methods for ramsey numbers
- Implicit $O(1)$ Probe Search
- Improved non-malleable extractors, non-malleable codes and independent source extractors
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy
- Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources
- MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS
- Explicit two-source extractors and resilient functions
- From affine to two-source extractors via approximate duality
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Extracting Randomness Using Few Independent Sources
- Some remarks on the theory of graphs
- Simulating independence
- Lower bounds for some Ramsey numbers
This page was built for publication: Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
