The low-degree polynomial hardness threshold conjecture for random k-SAT
Statement
Let be the clause width, let be the clause-density factor, and let denote a random -SAT formula with variables and clauses. Let Theorem~ and Theorem~ denote the hardness results stated above.
Low-degree polynomial threshold conjecture. Theorem~ (and Theorem~) holds for all .
This conjecture would close the constant-factor gap between the paper's hardness bound and the best known algorithms, establishing the algorithmic phase transition at clause density .
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.