On the probabilistic approach to the random satisfiability problem

TL;DR

This paper reviews recent heuristic results on the probabilistic analysis of the random satisfiability problem, highlighting phase transitions and discussing the survey decimation algorithm.

Contribution

It summarizes the current state of heuristic probabilistic methods applied to random satisfiability, including phase transition points and algorithm properties.

Findings

Identifies phase transition at α=4.267 for 3-satisfiability

Describes different regimes separated by specific α values

Discusses properties of the survey decimation algorithm

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 $\alpha=4.267$. There are other values of $\alpha$ 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.