Closed-form expressions for the sketching approximability of (some)
symmetric Boolean CSPs
Closed-form expressions for the sketching approximability of (some)
symmetric Boolean CSPs
A Boolean maximum constraint satisfaction problem, Max-CSP($f$), is specified by a constraint function $f:\{-1,1\}^k\to\{0,1\}$; an instance on $n$ variables is given by a list of constraints applying $f$ on a tuple of "literals" of $k$ distinct variables chosen from the $n$ variables. Chou, Golovnev, and Velusamy [CGV20] obtained explicit constants …