Kanj, Iyad, and Stefan Szeider. “On the Subexponential Time Complexity of CSP”. Proceedings of the AAAI Conference on Artificial Intelligence 27, no. 1 (June 30, 2013): 459-465. Accessed November 16, 2024. https://ojs.aaai.org/index.php/AAAI/article/view/8609.