ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let P:{0,1}k→{0,1}P:\{0,1\}^k\to\{0,1\} be a nontrivial kk-ary predicate. Consider a random instance of mathrmCSP(P)\\mathrm{CSP}(P) on nn variables with Δn\Delta n constraints, each applying PP to kk randomly chosen literals, where Δ≫1\Delta\gg 1. If PP supports a tt-wise uniform probability distribution on its satisfying assignments, then the sum-of-squares algorithm of degree d=Θ ⁣(nΔ2/(t−1)log⁡Δ)d=\Theta\!\left(\frac{n}{\Delta^{2/(t-1)}\log\Delta}\right), which runs in time nO(d)n^{O(d)}, cannot refute a random instance of CSP(P)\mathrm{CSP}(P). In particular, the polynomial-time SOS algorithm requires Ω~ ⁣(n(t+1)/2)\widetilde{\Omega}\!\left(n^{(t+1)/2}\right) constraints to refute random instances of CSP(P)\mathrm{CSP}(P) under this hypothesis.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.