1. Agrawal, M., Thierauf, T.: The Boolean isomorphism problem. In: Proceedings of 37th Conference on Foundations of Computer Science (FOCS), pp. 422–430. IEEE (1996)
2. Agrawal, M., Thierauf, T.: The formula isomorphism problem. SIAM J. Comput. 30(3), 990–1009 (2000)
3. Ausiello, G., Cristiano, F., Fantozzi, P., Laura, L.: Syntactic isomorphism of CNF Boolean formulas is graph isomorphism complete. In: Cordasco, G., Gargano, L., Rescigno, A.A. (eds.), Proceedings of the 21st Italian Conference on Theoretical Computer Science, Ischia, Italy, 14–16 September 2020, CEUR Workshop Proceedings, vol. 2756, pp. 190–201 (2020). CEUR-WS.org
4. Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016. ACM Press, New York (2016)
5. Benedetto, L., Fantozzi, P., Laura, L.: Complexity-based partitioning of CSFI problem instances with transformers (2021)