A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a xed set C of Boolean functions. We consider the problem of determining whether two given constraint satisfaction instances are equivalent in the sense that they possess the same sets of satisfying assignments. We prove a Dichotomy Theorem by showing that for all sets C of allowed constraints, this problem is either polynomial-time solvable or coNP-complete, and we give a simple criterion to determine which case holds. Another equivalence 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 manyone reducible to the graph isomorphism problem in all other cases.
|
112
|
Identifyig the minimal transversals of a hypergraph and related problems
– Eiter, Gottlob
- 1995
|
|
51
|
A dichotomy theorem for maximum generalized satisfiability problems
– Creignou
- 1995
|
|
43
|
Constraint satisfaction: The approximability of minimization problems
– Khanna, Sudan, et al.
- 1997
|
|
42
|
On the Structure of Polynomial-Time Reducibility
– Ladner
- 1975
|
|
41
|
The Graph Isomorphism Problem: Its Structural Complexity
– Kobler, Schoning, et al.
- 1993
|
|
33
|
The Complexity of Satis Problems
– Schaefer
- 1978
|
|
22
|
Finding almost-satisfying assignments
– Zwick
- 1998
|
|
20
|
Horn functions and their DNFs
– Hammer, Kogan
- 1992
|
|
19
|
A ploynomial-time approximation scheme for base station positioning in UMTS networks
– Galota, Glasser, et al.
- 2001
|
|
18
|
On the Hardness of Graph Isomorphism
– Toran
- 2000
|
|
15
|
The Boolean Isomorphism Problem
– Agrawal, Thierauf
- 1996
|
|
13
|
A complete classi of the approximability of maximization problems derived from boolean constraint satisfaction
– Khanna, Sudan, et al.
- 1997
|
|
13
|
Languages of Dot-Depth 3/2
– Glaer, Schmitz
- 2000
|
|
9
|
Problems polynomially equivalent to graph isomorphism
– Booth, Colbourn
- 1979
|
|
9
|
On the computational complexity of some classical equivalence relations on boolean functions
– Borchert, Ranjan, et al.
- 1998
|
|
8
|
Using Simulation and Genetic Algorithms to Improve Cluster Tool Performance
– Dummler
- 1999
|
|
8
|
The complexity of base station positioning in cellular networks
– Glaer, Reith, et al.
- 2000
|
|
8
|
Towards an optimization of the routing parameters for IP networks
– Staehle, Köhler, et al.
- 2000
|
|
8
|
Partially-Ordered Two-Way Automata: A New Characterization of DA
– Schwentick, Therien, et al.
- 2001
|
|
7
|
Complexity of generalized satis counting problems
– Creignou, Hermann
- 1996
|
|
7
|
Complexity Classi of Boolean Constraint Satisfaction Problems
– Creignou, Khanna, et al.
- 2001
|
|
7
|
Dichotomy theorem for the generalized unique satisfiability problem
– Juban
- 1999
|
|
7
|
Finite Automata with Generalized Acceptance Criteria. Januar
– Peichl, Vollmer
- 1999
|
|
7
|
On NP-partitions over posets with an application of reducing the set of solutions of NP problems
– Kosub
- 2000
|
|
6
|
The inverse satis problem
– Kavvadias, Sideri
- 1998
|
|
6
|
Generalized Deterministic Languages and their Automata: A Characterization of Restricted Temporal Logic
– Schmitz
- 1999
|
|
6
|
The Boolean Hierarchy over Dot-Depth 1=2
– Glaer
- 1999
|
|
6
|
Performance Comparison of Dierent Class-and-Drop Treatment of Data and Acknowledgements in DiServ IP Networks
– Kohler, Schafer
- 1999
|
|
6
|
Analytic performance evaluation of the RED algorithm for QoS in TCP/IP networks
– Köhler, Menth, et al.
- 2000
|
|
5
|
The complexity of minimal satis problems
– Kirousis, Kolaitis
- 2001
|
|
5
|
Optimal satis for propositional calculi and constraint satisfaction problems
– Reith, Vollmer
- 2000
|
|
5
|
Arithmetic Circuits and Polynomial Replacement Systems
– McKenzie, Vollmer, et al.
- 1999
|
|
5
|
Fast heuristics for optimal routing in large IP networks
– Berry, Kohler, et al.
- 2000
|
|
5
|
A Scalable Protocol Architecture for End-to-End Signaling and Resource Reservation
– Menth
- 2001
|
|
4
|
The complexity of problems de by Boolean circuits
– Reith, Wagner
- 2000
|
|
4
|
Uniform Characterizations of Complexity Classes. Januar
– Vollmer
- 1999
|
|
4
|
Wol von Gudenberg. The IAX Architecture: Interval Arithmetic Extension
– Kolla, Vodopivec, et al.
- 1999
|
|
4
|
Approximation Algorithms for Cellular Network Optimization
– Glaer, Reith, et al.
- 1999
|
|
4
|
The Boolean Hierarchy of Partitions. Juli
– Kosub, Wagner
- 1999
|
|
4
|
Featurebasierte Lokalisation eines autonomen mobilen Roboters
– Kluge, Schafer
- 1999
|
|
4
|
Consequences of the existence of sparse sets hard for NP under a subclass of truth-table reductions
– Glaer
- 2000
|
|
4
|
von Gudenberg. UMLscript sprachspezifikation
– Eichelberger, W
|
|
4
|
Boolean Hierarchy of Partitions over Reducible Bases
– Selivanov
- 2001
|
|
3
|
On generating all solutions of generalized satis problems. Informatique Theorique et Applications/Theoretical Informatics and Applications
– Creignou, Hebrard
- 1997
|
|
3
|
Generalized Satis Problems
– Reith
- 2001
|
|
3
|
Impact of Clustered Trac
– Ehrenberg, Leibnitz
- 1999
|
|
3
|
Was leistet die Komplexitatstheorie fur die Praxis? Marz
– Vollmer
- 1999
|
|
3
|
An approach for the identi of nonlinear, dynamic processes with Kalman Filter-trained recurrent neural structures
– Heister, Muller
- 1999
|
|
3
|
Simulation und Leistungsbewertung von Cluster Tools in der Halbleiterfertigung
– Dummler
- 1999
|
|
3
|
Boolean Hierarchies inside Dot-Depth One. Oktober
– Schmitz
- 1999
|
|
