2026-07-23T19:57:50Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6219 2024-03-06T10:37:46Z ddc:004 open_access

Analysing Survey Propagation Guided Decimationon Random Formulas Hetterich, Samuel Survey Propagation Guided Decimation Message Passing Algorithm Graph Theory Random k-SAT Let vec(theta) be a uniformly distributed random k-SAT formula with n variables and m clauses. For clauses/variables ratio m/n <= r_{k-SAT} ~ 2^k*ln(2) the formula vec(theta) is satisfiable with high probability. However, no efficient algorithm is known to provably find a satisfying assignment beyond m/n ~ 2k*ln(k)/k with a non-vanishing probability. Non-rigorous statistical mechanics work on k-CNF led to the development of a new efficient "message passing algorithm" called Survey Propagation Guided Decimation [Mézard et al., Science 2002]. Experiments conducted for k=3,4,5 suggest that the algorithm finds satisfying assignments close to r_{k-SAT}. However, in the present paper we prove that the basic version of Survey Propagation Guided Decimation fails to solve random k-SAT formulas efficiently already for m/n = 2^{k}(1 + epsilon_k)*ln(k)/k with lim_{k -> infinity} epsilon_k = 0 almost a factor k below r_{k-SAT}. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Samuel Hetterich 2016 Is Part Of LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2016.65 urn:nbn:de:0030-drops-62197 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.65 eng https://creativecommons.org/licenses/by/3.0/legalcode