3 problems

Alekhnovich–Ben-Sasson conjecture on the terminator threshold for random 2-SAT
arXiv@arxiv
Alekhnovich–Ben-Sasson conjecture. The terminator threshold matches the satisfiability threshold:
Conjectureopenrandom-2-sat randomized-algorithms walksat
1
The critical-point equations for degree-constrained random 2-SAT
arXiv@arxiv
Critical-point conjecture. The phase-transition point $r$ can be computed from the system
Conjectureopendegree-constrained-models phase-transitions random-2-sat
0
The discrete-excess conjecture for the contradictory component in random 2-SAT
arXiv@arxiv
Let $F$ be chosen uniformly at random from the set $\mathcal F(n,m)$ of 2-CNF formulas, and let $\xi$ denote the total excess of the strongly connected contradictory component in t…
Conjectureopenphase-transitions random-2-sat random-graphs
0

Alekhnovich–Ben-Sasson conjecture on the terminator threshold for random 2-SAT