1 Introduction
1.2 Techniques
1.3 Contrast with empirical studies of SP-guided decimation
1.4 Future work

2 Formal statement of main result
2.1 Not-All-Equal-K-Satisfiability (NAE K-SAT) problem
2.2 Sequential local algorithms for NAE K-SAT problem and the main result
2.3 BP-guided and SP-guided decimation algorithms as local sequential algorithms

3 Local algorithms and long-range independence

4 The clustering property of random NAE K-SAT problem

5 Proof of Theorem 2.4