Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete

Abstract

We investigate the complexity of the syntactic isomorphism problem of CNF Boolean Formulas (CSFI): given two CNF Boolean formulas φ(a1, . . . , an) and φ(b1, . . . , bn) decide whether there exists a permutation of clauses, a permutation of literals and a bijection between their variables such that φ(a1, . . . , an) and φ(b1, . . . , bn) become… (More)

Topics

1 Figure or Table

Cite this paper

@article{Ausiello2012SyntacticIO, title={Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete}, author={Giorgio Ausiello and Francesco Cristiano and Luigi Laura}, journal={Electronic Colloquium on Computational Complexity (ECCC)}, year={2012}, volume={19}, pages={122} }