Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete

Giorgio Ausiello, Francesco Cristiano, Paolo Fantozzi, Luigi Laura. Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. In Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno, editors, Proceedings of the 21st Italian Conference on Theoretical Computer Science, Ischia, Italy, September 14-16, 2020. Volume 2756 of CEUR Workshop Proceedings, pages 190-201, CEUR-WS.org, 2020. [doi]

Abstract

Abstract is missing.