{"paper":{"title":"Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.AI","cs.CC","cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"David Gamarnik, Madhu Sudan","submitted_at":"2014-02-01T05:05:12Z","abstract_excerpt":"We show that the Survey Propagation-guided decimation algorithm fails to find satisfying assignments on random instances of the \"Not-All-Equal-$K$-SAT\" problem if the number of message passing iterations is bounded by a constant independent of the size of the instance and the clause-to-variable ratio is above $(1+o_K(1)){2^{K-1}\\over K}\\log^2 K$ for sufficiently large $K$. Our analysis in fact applies to a broad class of algorithms described as \"sequential local algorithms\". Such algorithms iteratively set variables based on some local information and then recurse on the reduced instance. Surv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0052","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}