On the Subexponential Time Complexity of CSP

Abstract

Full Citation:

Iyad Kanj, Stefan Szeider. On the Subexponential Time Complexity of CSP. Proceedings of AAAI 2013, the 27th AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA (Marie des Jardins and Michael L. Littman), pages 459-465, 2013, The AAAI Press.

Stefan Szeider

Head of Research Unit

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