C C ] 3 O ct 2 00 7 On the satisfiability threshold and clustering of solutions of random 3Sat formulas

@inproceedings{Maneva2007CC,
  title={C C ] 3 O ct 2 00 7 On the satisfiability threshold and clustering of solutions of random 3Sat formulas},
  author={Elitza N. Maneva and Alistair Sinclair},
  year={2007}
}
We study the structure of satisfying assignments of a random 3-Sat formula. In particular, we show that a random formula of density α ≥ 4.453 almost surely has no non-trivial “core” assignments. Core assignments are certain partial assignments that can be extended to satisfying assignments, and have been studied recently in connection with the Survey… CONTINUE READING