Computer Science – Computational Complexity
Scientific paper
2002-12-07
Computer Science
Computational Complexity
13 pages, 3 figures
Scientific paper
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.
No associations
LandOfFree
On the survey-propagation equations for the random K-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 survey-propagation equations for the random K-satisfiability problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the survey-propagation equations for the random K-satisfiability problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-547988