The Connectivity of Boolean Satisfiability: No-Constants and Quantified Variants

Abstract

For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. Motivated by research on heuristics and the satisfiability threshold, Gopalan et al. in 2006 studied connectivity properties of the… (More)

Topics

1 Figure or Table

Slides referencing similar topics