Extractors for adversarial sources via extremal hypergraphs

DOI10.1145/3357713.3384339OpenAlexW3035605494MaRDI QIDQ5145003

Jesse Goodman, Eshan Chattopadhyay, Vipul Goyal, Xin Li

Publication date: 19 January 2021

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

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

zbMATH Keywords

explicit constructionsRamsey graphsrandomness extractorsextremal hypergraphscap setsnon-malleable extractors

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

On explicit constructions of designs ⋮ Improved computational extractors and their applications ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ How to extract useful randomness from unreliable sources ⋮ Multi-source non-malleable extractors and applications

This page was built for publication: Extractors for adversarial sources via extremal hypergraphs