Towards optimal two-source extractors and Ramsey graphs

DOI10.1145/3055399.3055429zbMath1370.68084OpenAlexW2625372793MaRDI QIDQ4978055

Gil Cohen

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey graphsmulti-source extractorsnon-malleable extractors

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Generalized Ramsey theory (05C55) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Extractors: low entropy requirements colliding with non-malleability ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Lower bounds for matrix factorization ⋮ Explicit two-source extractors and resilient functions ⋮ Lower bounds for matrix factorization

This page was built for publication: Towards optimal two-source extractors and Ramsey graphs