Subexponential Time Complexity of CSP with Global Constraints

Ronald de Haan, Iyad A. Kanj, Stefan Szeider. Subexponential Time Complexity of CSP with Global Constraints. In Barry O'Sullivan, editor, Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings. Volume 8656 of Lecture Notes in Computer Science, pages 272-288, Springer, 2014. [doi]

Abstract

Abstract is missing.