14 citations · 16 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
Konrad W. Schwerdtfeger
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 connect…
cs.CC2013
A Computational Trichotomy for Connectivity of Boolean Satisfiability
Konrad W. Schwerdtfeger
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 connect…