Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR12-105 | 17th August 2012 23:00

$LS_+$ Lower Bounds from Pairwise Independence


Authors: Madhur Tulsiani, Pratik Worah
Publication: 24th August 2012 08:52
Downloads: 1333


We consider the complexity of LS$_+$ refutations of unsatisfiable instances of Constraint Satisfaction Problems (CSPs) when the underlying predicate supports a pairwise independent distribution on its satisfying assignments. This is the most general condition on the predicates under which the corresponding MAX-CSP problem is known to be approximation resistant.

We show that for random instances of such CSPs on $n$ variables, even after $\Omega(n)$ rounds of the LS$_+$ hierarchy, the integrality gap remains equal to the approximation ratio achieved by a random assignment. In particular, this also shows that LS$_+$ refutations for such instances require rank $\Omega(n)$. We also show the stronger result that refutations for such instances in the \emph{static} LS$_+$ proof system requires size $\exp(\Omega(n))$.

ISSN 1433-8092 | Imprint