Computer Science – Computational Complexity
Scientific paper
2003-08-05
Computer Science
Computational Complexity
11 pages, proceedings of SAT 2003
Scientific paper
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.
No associations
LandOfFree
On the probabilistic approach to the random satisfiability problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the probabilistic approach to the random satisfiability problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the probabilistic approach to the random satisfiability problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-571761