The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

@article{Gopalan2006TheCO,
  title={The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies},
  author={Parikshit Gopalan and Phokion G. Kolaitis and Elitza N. Maneva and Christos H. Papadimitriou},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2006},
  volume={13}
}
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisfiability threshold has centered around the structure and connectivity of the so lution space. Motivated by this work, we study structural and connectivity-related properties of t he space of solutions of Boolean satisfiability problems and establish various dichotomies in Schaefer’s f ramework. On the structural side… CONTINUE READING
Highly Influential
This paper has highly influenced a number of papers. REVIEW HIGHLY INFLUENTIAL CITATIONS