ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be the clause width, let κ\kappa be the clause-density factor, and let Φk(n,m)\Phi_k(n,m) denote a random kk-SAT formula with nn variables and mm clauses. Let Theorem~ and Theorem~ denote the hardness results stated above.

Low-degree polynomial threshold conjecture. Theorem~ (and Theorem~) holds for all κ>1\kappa > 1.

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 (1+ok(1))2klog⁡k/k(1+o_k(1))2^k\log k/k.

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.