GCP Constraint Based SAT Clause Generation in Polynomial Time. International Journal of Advanced Research in Computer Science, [S. l.], v. 7, n. 2, p. 30–34, 2017. DOI: 10.26483/ijarcs.v7i2.2636. Disponível em: https://www.ijarcs.info/index.php/Ijarcs/article/view/2636. Acesso em: 22 feb. 2026.