2 problems

The Monasson et al. mixed 2- and 3-SAT threshold conjecture
Monasson et al.'s mixed-SAT conjecture. For every $p\in[0,1]$ there exists a value $\alpha_\mathrm{sat}(2+p)>0$ such that, whenever $\alpha_2,\alpha_3>0$ satisfy…
openphase-transitions random-constraint-satisfaction random-sat
0 responses
06
The Chvátal–Reed satisfiability threshold conjecture for random k-SAT
Chvátal–Reed conjecture. For all $k\geq 2$ there exists a value $\alpha_\mathrm{sat}(k)>0$ such that
opencomputational-complexity phase-transitions random-sat
0 responses
05

The Monasson et al. mixed 2- and 3-SAT threshold conjecture