@InProceedings{lovett_et_al:LIPIcs.CCC.2019.5, author = {Lovett, Shachar and Solomon, Noam and Zhang, Jiapeng}, title = {{From DNF Compression to Sunflower Theorems via Regularity}}, booktitle = {34th Computational Complexity Conference (CCC 2019)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-116-0}, ISSN = {1868-8969}, year = {2019}, volume = {137}, editor = {Shpilka, Amir}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2019.5}, URN = {urn:nbn:de:0030-drops-108277}, doi = {10.4230/LIPIcs.CCC.2019.5}, annote = {Keywords: DNF sparsification, sunflower conjecture, regular set systems} }