On the probabilistic approach to the random satisfiability problem
| dc.creator | Parisi, Giorgio | |
| dc.date | 2003-08-05 | |
| dc.date.accessioned | 2026-07-07T03:20:12Z | |
| dc.date.available | 2026-07-07T03:20:12Z | |
| dc.description | 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. | |
| dc.description | 11 pages, proceedings of SAT 2003 | |
| dc.identifier | https://arxiv.org/abs/cs/0308010 | |
| dc.identifier | http://arxiv.org/abs/cs/0308010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31740 | |
| dc.subject | Computational Complexity | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | G.3, G.2.1 G.3, G.2.1 G.3, G.2.1 | |
| dc.title | On the probabilistic approach to the random satisfiability problem | |
| dc.type | text |