The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits

Konrad W. Schwerdtfeger. The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. Theory Comput. Syst., 61(2):263-282, 2017. [doi]

Abstract

Abstract is missing.