Worst-case study of local search for MAX-k-SAT

AbstractDuring the past 3 years there was a considerable growth in the number of algorithms solving MAX-SAT and MAX-2-SAT in worst-case time of the order cK, where c<2 is a constant, and K is the number of clauses of the input formula. However, similar bounds w.r.t. the number of variables instead of the number of clauses are not known.Also, it was proved that approximate solutions for these problems (even beyond inapproximability ratios) can be obtained faster than exact solutions. However, the corresponding exponents still depended on the number of clauses of the input formula. In this paper, we give a randomized (1−ε)-approximation algorithm for MAX-k-SAT whose worst-case time bound depends on the number of variables.Our algorithm and its analysis are based on Schöning's proof of the best current worst-case time bound for k-SAT (in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, FOCS’99, 1999 pp. 410–414). Similarly to Schöning's algorithm (which is also very close to Papadimitriou's algorithm (in: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS’91, 1991, pp. 163–169) and the experimentally successful WalkSAT family by Selman et al. (in: Proceedings of the AAAI’97, 1997, pp. 321–326; in: Proceedings of the 12th National Conference on Artificial Intelligence, AAAI’94, 1994, pp. 337–343)), our algorithm makes random walks of polynomial length. We prove that the probability of error in each walk is at most 1−ck,ε−N, where N is the number of variables, and ck,ε<2 is a constant depending on k and ε. Therefore, making ⌈−lnρ⌉ck,εN such walks gives the probability of error bounded from above by any predefined constant ρ>0