{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article8715","name":"Analysing Survey Propagation Guided Decimationon Random Formulas","abstract":"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\u00e9zard 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}.","keywords":["Survey Propagation Guided Decimation","Message Passing Algorithm","Graph Theory","Random k-SAT"],"author":{"@type":"Person","name":"Hetterich, Samuel","givenName":"Samuel","familyName":"Hetterich"},"position":65,"pageStart":"65:1","pageEnd":"65:12","dateCreated":"2016-08-23","datePublished":"2016-08-23","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Hetterich, Samuel","givenName":"Samuel","familyName":"Hetterich"},"copyrightYear":"2016","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.65","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6258","volumeNumber":55,"name":"43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)","dateCreated":"2016-08-23","datePublished":"2016-08-23","editor":[{"@type":"Person","name":"Chatzigiannakis, Ioannis","givenName":"Ioannis","familyName":"Chatzigiannakis"},{"@type":"Person","name":"Mitzenmacher, Michael","givenName":"Michael","familyName":"Mitzenmacher"},{"@type":"Person","name":"Rabani, Yuval","givenName":"Yuval","familyName":"Rabani"},{"@type":"Person","name":"Sangiorgi, Davide","givenName":"Davide","familyName":"Sangiorgi"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article8715","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6258"}}}