O’Donnell–Schramm Sherali–Adams question
Statement
For random Boolean -ary constraint satisfaction problems, particularly for odd , 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 relative to the bound of O’Donnell and Schramm?
Record
- Added
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.