24 citations · 43 across the 12 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 4 cited
DNF Sparsification and a Faster Deterministic Counting Algorithm
Parikshit Gopala, Raghu Meka, Omer Reingold
Given a DNF formula on n variables, the two natural size measures are the number of terms or size s(f), and the maximum width of a term w(f). It is folklore that short DNF formulas…
cs.DS2012★ 11 cited
Constructive Discrepancy Minimization by Walking on The Edges
Shachar Lovett, Raghu Meka
Minimizing the discrepancy of a set system is a fundamental problem in combinatorics. One of the cornerstones in this area is the celebrated six standard deviations result of Spenc…