ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For random Boolean kk-ary constraint satisfaction problems, particularly for odd kk, does the Sherali–Adams hierarchy achieve refutation guarantees comparable to those obtained by the stronger sum-of-squares hierarchy? Equivalently, for a prescribed Sherali–Adams degree, can the constraint-density requirement for strong refutation be reduced polynomially in nn relative to the bound of O’Donnell and Schramm?

Record

Added
Links

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.