A Computational Trichotomy for Connectivity of Boolean Satisfiability (original) (raw)
Related papers
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
SIAM Journal on Computing, 2009
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
Lecture Notes in Computer Science, 2014
A Dichotomy Theorem within Schaefer for the Boolean Connectivity Problem
Eccc, 2007
An exact algorithm for the Boolean connectivity problem for k-CNF
Theoretical Computer Science, 2011
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
Lecture Notes in Computer Science
A Complete Characterization of Complexity for Boolean Constraint Optimization Problems
Lecture Notes in Computer Science, 2004
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
Journal of Artificial Intelligence Research
Lower bound for the Complexity of the Boolean Satisfiability Problem
arXiv (Cornell University), 2016
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics, 2010
On Modeling Connectedness in Reductions from Graph Problems to Extended Satisfiability
Lecture Notes in Computer Science, 2012
Generalizing boolean satisfiability II: Theory
2004
The Complexity of Boolean Constraint Isomorphism
Corr, 2003
Necessary and sufficient conditions for Boolean satisfiability
ArXiv, 2019
Solution-Graphs of Boolean Formulas and Isomorphism1
Journal on Satisfiability, Boolean Modeling and Computation, 2019
2004, ‘Generalizing Boolean Satisfiability II: Theory
2016
Solving the satisfiability problem through Boolean networks
AI* IA 99: Advances in Artificial Intelligence, 2000
Complexity and structural heuristics for propositional and quantified satisfiability
2007
Combinatorial optimization of boolean satisfiability problems
2013
The Helly property and satisfiability of Boolean formulas defined on set families
European Journal of Combinatorics, 2010
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
2005
Tractable Structures for Constraint Satisfaction with Truth Tables
Theory of Computing Systems, 2009
An Empirical Measure for Characterizing 3-SAT
2002
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters, 2011
On the Computational Complexity of Monotone Constraint Satisfaction Problems
Lecture Notes in Computer Science, 2009
The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions
Francesco Scarcello, Georg Gottlob
International Joint Conference on Artificial Intelligence, 2005
Generalizing Boolean Satisfiability III: Implementation
Journal of Artificial Intelligence Research
Identifying the Shortest Path in Large Networks using Boolean Satisfiability
2006 3rd International Conference on Electrical and Electronics Engineering, 2006
Non-dichotomies in Constraint Satisfaction Complexity
Automata, Languages and Programming, 2008
Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory
2019
The Complexity of the Boolean Formula Value Problem
Resolvable Networks—A Graphical Tool for Representing and Solving SAT
Mathematics, 2021
A compressed breadth-first search for satisfiability
2002