Extractors for a constant number of polynomially small min-entropy independent sources

DOI10.1145/1132516.1132589zbMath1301.68194OpenAlexW2084567084MaRDI QIDQ2931412

No author found.

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1132516.1132589

zbMATH Keywords

Ramsey graphsextractorindependent sources

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources ⋮ Extracting Computational Entropy and Learning Noisy Linear Functions ⋮ 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 ⋮ Improving the Hadamard extractor ⋮ Extracting Kolmogorov complexity with applications to dimension zero-one laws ⋮ Unnamed Item ⋮ Increasing the output length of zero-error dispersers

This page was built for publication: Extractors for a constant number of polynomially small min-entropy independent sources