SOS lower bound for refuting random CSP instances
Statement
Let be a nontrivial -ary predicate. Consider a random instance of on variables with constraints, each applying to randomly chosen literals, where . If supports a -wise uniform probability distribution on its satisfying assignments, then the sum-of-squares algorithm of degree , which runs in time , cannot refute a random instance of . In particular, the polynomial-time SOS algorithm requires constraints to refute random instances of 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.