Typical random 3-SAT formulae and the satisfiability threshold
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
Abstract
We present a new structural (or syntatic) approach for estimating the satisfiability threshold of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous upper bounds, lowering them to 4.506. The method combines well with other techniques, and also applies to other problems, such as the 3-colourability of random graphs.
Create a lesson
Related papers
Integrality gap preserving reductions
Koppány István Encz, Monaldo Mastrolilli, Eleonora Vercesi
Structural Parameterizations for Eternal Vertex Cover
Neeldhara Misra, Sebastian Ordyniak, Giacomo Paesani et al.
Ramsey Obstructions to Disambiguation
Romain Bourneuf, Antonin Kiladjian, Stéphan Thomassé
Two-Machine Flow Shop with a Fixed Non-Availability Interval on the Second Machine
Hao Lu, Yuan Yuan, Xingwu Liu et al.
Tournaments not inducible by five voters
Leonid Chindelevitch, Ararat Harutyunyan
Oblivious Self-Distance Symmetric Rendezvous on the Integer Line
Konstantinos Georgiou, Claude Gravel, Lazar Mandic et al.