Simulating independence
From MaRDI portal
Publication:5901033
DOI10.1145/1734213.1734214zbMath1327.68172OpenAlexW1964153304MaRDI QIDQ5901033
Avi Wigderson, Benjamin Sudakov, Ronen Shaltiel, Boaz Barak, Guy Kindler
Publication date: 14 July 2010
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1734213.1734214
Graph theory (including graph drawing) in computer science (68R10) Generalized Ramsey theory (05C55) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy ⋮ On sum-product representation in \(\mathbb Z_q\) ⋮ The size Ramsey number of a directed path ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quasi chain rule for min-entropy ⋮ An Introduction to Randomness Extractors ⋮ Improving the Hadamard extractor ⋮ Unnamed Item ⋮ Extractors and Lower Bounds for Locally Samplable Sources ⋮ How to extract useful randomness from unreliable sources ⋮ Unnamed Item ⋮ Explicit two-source extractors and resilient functions ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs ⋮ Extractors for small zero-fixing sources
