From DNF compression to sunflower theorems via regularity
Electronic Colloquium on Computational Complexity (ECCC), pp. 282019.
The sunflower conjecture is one of the most well-known open problems in combinatorics. It has several applications in theoretical computer science, one of which is DNF compression, due to Gopalan, Meka and Reingold [Computational Complexity 2013]. In this paper, we show that improved bounds for DNF compression imply improved bounds for th...More
PPT (Upload PPT)