## Amin Coja-Oghlan ; Michael Krivelevich ; Dan Vilenchik - Why almost all satisfiable $k$-CNF formulas are easy

dmtcs:3538 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07) - https://doi.org/10.46298/dmtcs.3538
Why almost all satisfiable $k$-CNF formulas are easy

Authors: Amin Coja-Oghlan 1; Michael Krivelevich 2; Dan Vilenchik 3

• 1 Department of Mathematical Sciences
• 2 School of Mathematical Sciences [Tel Aviv]
• 3 Blavatnik School of Computer Science [Tel Aviv]

Finding a satisfying assignment for a $k$-CNF formula $(k \geq 3)$, assuming such exists, is a notoriously hard problem. In this work we consider the uniform distribution over satisfiable $k$-CNF formulas with a linear number of clauses (clause-variable ratio greater than some constant). We rigorously analyze the structure of the space of satisfying assignments of a random formula in that distribution, showing that basically all satisfying assignments are clustered in one cluster, and agree on all but a small, though linear, number of variables. This observation enables us to describe a polynomial time algorithm that finds $\textit{whp}$ a satisfying assignment for such formulas, thus asserting that most satisfiable $k$-CNF formulas are easy (whenever the clause-variable ratio is greater than some constant). This should be contrasted with the setting of very sparse $k$-CNF formulas (which are satisfiable $\textit{whp}$), where experimental results show some regime of clause density to be difficult for many SAT heuristics. One explanation for this phenomena, backed up by partially non-rigorous analytical tools from statistical physics, is the complicated clustering of the solution space at that regime, unlike the more "regular" structure that denser formulas possess. Thus in some sense, our result rigorously supports this explanation.

Volume: DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Section: Proceedings
Published on: January 1, 2007
Imported on: May 10, 2017
Keywords: SAT,computational and structural complexity,algorithms and data structures,message passing algorithms,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]

## Linked publications - datasets - softwares

 Source : ScholeXplorer IsRelatedTo DOI 10.1007/11830924_32 10.1007/11830924_32 10.1007/11830924_32 Complete convergence of message passing algorithms for some satisfiability problems