English

The SDP value of random 2CSPs

Data Structures and Algorithms 2021-08-03 v1 Computational Complexity Combinatorics Probability

Abstract

We consider a very wide class of models for sparse random Boolean 2CSPs; equivalently, degree-2 optimization problems over~{±1}n\{\pm 1\}^n. For each model M\mathcal{M}, we identify the "high-probability value"~sMs^*_{\mathcal{M}} of the natural SDP relaxation (equivalently, the quantum value). That is, for all ε>0\varepsilon > 0 we show that the SDP optimum of a random nn-variable instance is (when normalized by~nn) in the range (sMε,sM+ε)(s^*_{\mathcal{M}}-\varepsilon, s^*_{\mathcal{M}}+\varepsilon) with high probability. Our class of models includes non-regular CSPs, and ones where the SDP relaxation value is strictly smaller than the spectral relaxation value.

Cite

@article{arxiv.2108.01038,
  title  = {The SDP value of random 2CSPs},
  author = {Amulya Musipatla and Ryan O'Donnell and Tselil Schramm and Xinyu Wu},
  journal= {arXiv preprint arXiv:2108.01038},
  year   = {2021}
}
R2 v1 2026-06-24T04:45:50.620Z