F. Vorobyev

An upper bound of 4.268 for the random 3-SAT satisfiability threshold

We prove that a random 3-SAT formula with $n$ variables and $\lfloor 4.268n\rfloor$ clauses is unsatisfiable with high probability. The satisfiability threshold has attracted considerable attention: successive upper bounds reached 4.4898 in the work of D\'iaz, Kirousis, Mitsche, and P\'erez-Gim\'enez, while the cavity...