KANJ, I.; SZEIDER, S. On the Subexponential Time Complexity of CSP. Proceedings of the AAAI Conference on Artificial Intelligence, [S. l.], v. 27, n. 1, p. 459-465, 2013. DOI: 10.1609/aaai.v27i1.8609. Disponível em: https://ojs.aaai.org/index.php/AAAI/article/view/8609. Acesso em: 16 nov. 2024.