Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete

Giorgio Ausiello, Francesco Cristiano, Luigi Laura. Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. Electronic Colloquium on Computational Complexity (ECCC), 19:122, 2012. [doi]

Abstract

Abstract is missing.