Kanj, I., and S. Szeider. “On the Subexponential Time Complexity of CSP”. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 27, no. 1, June 2013, pp. 459-65, doi:10.1609/aaai.v27i1.8609.