24 citations · 43 across the 12 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2026★ 1 cited
New Lower and Upper Bounds for the Grothendieck Constant
Rahul Saha, Alan Li, Anton Xue +4
We establish new bounds on the Grothendieck constant : \[ \frac{6π}{11} \le K_G \le \fracπ{2\log(1+\sqrt2)} - 10^{-4}. \] Methodologically, our lower bound approach differs fr…
cs.CC2014★ 3 cited
Pseudorandomness for concentration bounds and signed majorities
Parikshit Gopalan, Daniel Kane, Raghu Meka
The problem of constructing pseudorandom generators that fool halfspaces has been studied intensively in recent times. For fooling halfspaces over the hypercube with polynomially s…
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…