On the Subexponential-Time Complexity of CSP

Abstract

Full Citation:

Ronald de Haan, Iyad A. Kanj, Stefan Szeider. On the Subexponential-Time Complexity of CSP. Journal of Artificial Intelligence Research, volume 52, pages 203-234, 2015.

Stefan Szeider
Stefan Szeider
Head of Research Unit

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