Simulating independence
From MaRDI portal
Publication:5901100
DOI10.1145/1060590.1060592zbMath1192.68468OpenAlexW2157843680MaRDI QIDQ5901100
Guy Kindler, Ronen Shaltiel, Avi Wigderson, Benjamin Sudakov, Boaz Barak
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060592
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Generalized Ramsey theory (05C55) Randomized algorithms (68W20)
Related Items (17)
Zero-Fixing Extractors for Sub-Logarithmic Entropy ⋮ From Affine to Two-Source Extractors via Approximate Duality ⋮ Local Correlation Breakers and Applications to Three-Source Extractors and Mergers ⋮ Deterministic extractors for affine sources over large fields ⋮ A bipartite analogue of Dilworth's theorem ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ 2-source dispersers for \(n^{o(1)}\) entropy, and Ramsey graphs beating the Frankl-Wilson construction ⋮ Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors ⋮ How to get more mileage from randomness extractors ⋮ Increasing the Output Length of Zero-Error Dispersers ⋮ Deterministic extractors for small-space sources ⋮ Induced Ramsey-type theorems ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws ⋮ Unnamed Item ⋮ The sum-product theorem in \(\mathbb Z_q\) with \(q\) arbitrary ⋮ Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators ⋮ Increasing the output length of zero-error dispersers
This page was built for publication: Simulating independence
