Why almost all satisfiable k-CNF formulas are easy

  title={Why almost all satisfiable k-CNF formulas are easy},
  author={Amin Coja-Oghlan and Michael Krivelevich and Dan Vilenchik},
Finding a satisfying assignment for a k-CNF formula (k ≥ 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… CONTINUE READING