On the probabilistic approach to the random satisfiability problem
Giorgio Parisi
Abstract
In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random 3-satisfiability problem a phase transition from the satisfiable to the unsatisfiable phase is found at α=4.267. There are other values of α that separates different regimes and they will be described in details. In this context the properties of the survey decimation algorithm will also be discussed.
Create a lesson
Related papers
The determinantal complexity of the 4*4 permanent is 15
Karthik Sheshadri
A Width Hierarchy of Monotone Algebraic Branching Programs
Julian Dörfler, Alexander Rogovskyy
Mortality Is Undecidable for 2 × 2 Integer Matrices
Thanin Quartz, Ivan O. Shevchenko, Hans De Sterck et al.
Fourier Entropy Bounds via Approximations
Manaswi Paraashar, Nitin Saurabh
An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine
Sergey Salishev
Exhaustive Search Is Hard to Beat in Constant Depth for Hyperclique and Orthogonal Vectors
Nikolai Chukhin