SIGACT news complexity theory column 34
ACM SIGACT News
Approximation of Relations by Propositional Formulas: Complexity and Semantics
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Evaluation of an Algorithm for the Transversal Hypergraph Problem
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
An efficient algorithm for Horn description
Information Processing Letters
The complexity of minimal satisfiability problems
Information and Computation
SIGACT news complexity theory column 43
ACM SIGACT News
Computational Complexity
Structure identification of Boolean relations and plain bases for co-clones
Journal of Computer and System Sciences
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
New polynomial classes for logic-based abduction
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the boolean connectivity problem for horn relations
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On the Boolean connectivity problem for Horn relations
Discrete Applied Mathematics
The connectivity of boolean satisfiability: computational and structural dichotomies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete
Theoretical Computer Science
Inverse HAMILTONIAN CYCLE and inverse 3-d MATCHING are coNP-Complete
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We study the complexity of telling whether a set of bit-vectors represents the set of all satisfying truth assignments of a Boolean expression of a certain type. We show that the problem is coNP-complete when the expression is required to be in conjunctive normal form with three literals per clause (3CNF). We also prove a dichotomy theorem analogous to the classical one by Schaefer, stating that, unless P=NP, the problem can be solved in polynomial time if and only if the clauses allowed are all Horn, or all anti-Horn, or all 2CNF, or all equivalent to equations modulo two.