2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction
DOI10.1145/1132516.1132611zbMath1301.68191OpenAlexW2135963330MaRDI QIDQ2931427
Avi Wigderson, Anup Rao, Ronen Shaltiel, Boaz Barak
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.1132611
Graph theory (including graph drawing) in computer science (68R10) Generalized Ramsey theory (05C55) Measures of information, entropy (94A17) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (21)
This page was built for publication: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction