On the survey-propagation equations for the random K-satisfiability problem
<|reference_start|>On the survey-propagation equations for the random K-satisfiability problem: 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.<|reference_end|>
@article{parisi2002on,
    title={On the survey-propagation equations for the random K-satisfiability
  problem},
    author={Giorgio Parisi},
    journal={arXiv preprint arXiv:cs/0212009},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0212009},
    primaryClass={cs.CC cond-mat.dis-nn}
}