6 citations · 20 across the 25 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CC2019
Decision list compression by mild random restrictions
Shachar Lovett, Kewen Wu, Jiapeng Zhang
A decision list is an ordered list of rules. Each rule is specified by a term, which is a conjunction of literals, and a value. Given an input, the output of a decision list is the…
math.CO2019★ 6 cited
Improved bounds for the sunflower lemma
Ryan Alweiss, Shachar Lovett, Kewen Wu +1
A sunflower with petals is a collection of sets so that the intersection of each pair is equal to the intersection of all of them. Erdős and Rado proved the sunflower lemma…
math.CO2019★ 1 cited
From DNF compression to sunflower theorems via regularity
Shachar Lovett, Noam Solomon, Jiapeng Zhang
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,…