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~. For each model , we identify the "high-probability value"~ of the natural SDP relaxation (equivalently, the quantum value). That is, for all we show that the SDP optimum of a random -variable instance is (when normalized by~) in the range 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}
}