Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem

We formalize the class of “sequential local algorithms" and show that these algorithms fail to find satisfying assignments on random instances of the “Not-All-Equal-$K$-SAT” (NAE-$K$-SAT) problem if the number of message passing iterations is bounded by a function moderately growing in the number of variables and if the clause-to-variable ratio is above $(1+o_K(1)){2^{K-1}\over K}\ln^2 K$ for sufficiently large $K$. Sequential local algorithms are those that iteratively set variables based on some local information and/or local randomness and then recurse on the reduced instance. Our model captures some weak abstractions of natural algorithms such as Survey Propagation (SP)-guided as well as Belief Propagation (BP)-guided decimation algorithms---two widely studied message-passing--based algorithms---when the number of message-passing rounds in these algorithms is restricted to be growing only moderately with the number of variables. The approach underlying our paper is based on an intricate geometry of th...

[1]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[2]  B. Szegedy,et al.  Limits of locally–globally convergent graph sequences , 2014 .

[3]  Riccardo Zecchina,et al.  Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.

[4]  Michael Krivelevich,et al.  Two‐coloring random hypergraphs , 2002, Random Struct. Algorithms.

[5]  Bart Selman,et al.  Survey Propagation Revisited , 2007, UAI.

[6]  Konstantinos Panagiotou,et al.  Catching the k-NAESAT threshold , 2011, STOC '12.

[7]  Amin Coja-Oghlan A Better Algorithm for Random k-SAT , 2009, ICALP.

[8]  Madhu Sudan,et al.  Limits of local algorithms over sparse random graphs , 2013, ITCS.

[9]  Martin J. Wainwright,et al.  A new look at survey propagation and its generalizations , 2004, SODA '05.

[10]  Guilhem Semerjian,et al.  On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms , 2009, ArXiv.

[11]  Bálint Virág,et al.  Local algorithms for independent sets are half-optimal , 2014, ArXiv.

[12]  Andrea Montanari,et al.  Reconstruction and Clustering in Random Constraint Satisfaction Problems , 2011, SIAM J. Discret. Math..

[13]  Samuel Hetterich,et al.  Analysing Survey Propagation Guided Decimation on Random Formulas , 2016, ICALP.

[14]  Amin Coja-Oghlan,et al.  Algorithmic Barriers from Phase Transitions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[15]  Riccardo Zecchina,et al.  Entropy landscape and non-Gibbs solutions in constraint satisfaction problems , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  M. Mézard,et al.  Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.

[17]  Amin Coja-Oghlan,et al.  On belief propagation guided decimation for random k-SAT , 2010, SODA '11.

[18]  Cristopher Moore,et al.  Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold , 2003, SIAM J. Comput..

[19]  Andrea Montanari,et al.  Gibbs states and the set of solutions of random constraint satisfaction problems , 2006, Proceedings of the National Academy of Sciences.

[20]  Leonid A. Levin,et al.  Average Case Complete Problems , 1986, SIAM J. Comput..