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
Marton's conjecture in polynomial time
Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal et al.
Efficient Randomized Communication Without Large Monochromatic Rectangles
Haoyu Wang, Pei Wu
On the Turing Completeness of Transformers and Agents
Yimu Qiao, Lijia Yu, Ruichen Qiu et al.
Dense Pinwheel Packing Is Strongly NP-Complete
Yusuke Kobayashi, Bingkai Lin, Joseph Swernofsky
A Separation Between Distribution-Free SQ Learning and Dimension Complexity
Shyamal Patel
Almost Optimal FPT Inapproximability for k-SetCover
Venkatesan Guruswami, Xuandi Ren