Subexponential Time Complexity of CSP with Global Constraints

Abstract

Full Citation:

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

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.