The complexity of Boolean constraint isomorphism

Abstract

We consider the Boolean constraint isomorphism problem, that is, the problem of determining whether two sets of Boolean constraint applications can be made equivalent by renaming the variables. We show that depending on the set of allowed constraints, the problem is either coNP-hard and GI-hard, equivalent to graph isomorphism, or polynomial-time solvable. This establishes a complete classification of the complexity of the problem, and moreover, it identifies exactly all those cases in which Boolean constraint isomorphism is polynomial-time manyone equivalent to graph isomorphism, the best-known and best-examined isomorphism problem in theoretical computer science. © Springer-Verlag 2004.