Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
The SDP value of random 2CSPs
Amulya Musipatla, Ryan O'Donnell, Tselil Schramm +1
We consider a very wide class of models for sparse random Boolean 2CSPs; equivalently, degree-2 optimization problems over~. For each model , we identify…
cs.DS2021
Noisy Boolean Hidden Matching with Applications
Michael Kapralov, Amulya Musipatla, Jakab Tardos +2
The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper of Gavinsky et. al. [STOC'07], has played an important role in the streaming lower bounds for graph problem…