On the probabilistic approach to the random satisfiability problem
Computational Complexity
2007-05-23 v1 Disordered Systems and Neural Networks
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 . 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.
Cite
@article{arxiv.cs/0308010,
title = {On the probabilistic approach to the random satisfiability problem},
author = {Giorgio Parisi},
journal= {arXiv preprint arXiv:cs/0308010},
year = {2007}
}
Comments
11 pages, proceedings of SAT 2003