Shachar Lovett, Noam Solomon, Jiapeng Zhang. From DNF Compression to Sunflower Theorems via Regularity. In Amir Shpilka, editor, 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA. Volume 137 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
@inproceedings{LovettSZ19-0,
title = {From DNF Compression to Sunflower Theorems via Regularity},
author = {Shachar Lovett and Noam Solomon and Jiapeng Zhang},
year = {2019},
doi = {10.4230/LIPIcs.CCC.2019.5},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.5},
researchr = {https://researchr.org/publication/LovettSZ19-0},
cites = {0},
citedby = {0},
booktitle = {34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA},
editor = {Amir Shpilka},
volume = {137},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-116-0},
}