On the survey-propagation equations for the random K-satisfiability problem
| dc.creator | Parisi, Giorgio | |
| dc.date | 2002-12-07 | |
| dc.date.accessioned | 2026-07-07T03:19:13Z | |
| dc.date.available | 2026-07-07T03:19:13Z | |
| dc.description | In this note we study the existence of a solution to the survey-propagation equations for the random K-satisfiability problem for a given instance. We conjecture that when the number of variables goes to infinity, the solution of these equations for a given instance can be approximated by the solution of the corresponding equations on an infinite tree. We conjecture (and we bring numerical evidence) that the survey-propagation equations on the infinite tree have an unique solution in the suitable range of parameters. | |
| dc.description | 13 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0212009 | |
| dc.identifier | http://arxiv.org/abs/cs/0212009 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31371 | |
| dc.subject | Computational Complexity | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | G.3, G.2.1 | |
| dc.title | On the survey-propagation equations for the random K-satisfiability problem | |
| dc.type | text |