The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
From MaRDI portal
Publication:4981174
DOI10.1007/978-3-319-06686-8_27zbMath1379.68179OpenAlexW1868426342MaRDI QIDQ4981174
Publication date: 24 June 2014
Published in: Computer Science - Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_27
Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40) Switching theory, applications of Boolean algebras to circuits and networks (94C11)
Related Items (2)
The connectivity of Boolean satisfiability: dichotomies for formulas and circuits ⋮ Homomorphism Reconfiguration via Homotopy
This page was built for publication: The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
