On truth-table reducibility to SAT
Information and Computation
SIAM Journal on Computing
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Complexity of generalized satisfiability counting problems
Information and Computation
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
The Formula Isomorphism Problem
SIAM Journal on Computing
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Two remarks on the power of counting
Proceedings of the 6th GI-Conference on Theoretical Computer Science
On the hardness of graph isomorphism
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
SIGACT news complexity theory column 43
ACM SIGACT News
The complexity of equivalence and isomorphism of systems of equations over finite groups
Theoretical Computer Science - Mathematical foundations of computer science 2004
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Partial Polymorphisms and Constraint Satisfaction Problems
Complexity of Constraints
Complexity of default logic on generalized conjunctive queries
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Enumerating all solutions for constraint satisfaction problems
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic (TOCL)
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimization for generalized Boolean formulas
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
A Boolean constraint satisfaction instance is a set of constraint applications where the allowed constraints are drawn from a fixed set C of Boolean functions. We consider the problem of determining whether two given constraint satisfaction instances are equivalent and prove a dichotomy theorem by showing that for all finite sets C of constraints, this problem is either polynomial-time solvable or coNP-complete, and we give a simple criterion to determine which case holds. A more general problem addressed in this paper is the isomorphism problem, the problem of determining whether there exists a renaming of the variables that makes two given constraint satisfaction instances equivalent in the above sense. We prove that this problem is coNP-hard if the corresponding equivalence problem is coNP-hard, and polynomial-time many-one reducible to the graph isomorphism problem in all other cases.