On the Subexponential-Time Complexity of CSP.

Ronald de Haan Iyad A. Kanj Stefan Szeider

Published in: J. Artif. Intell. Res. (2015)

Keyphrases

constraint satisfaction problems
computational complexity
worst case
constraint propagation
databases
computer vision
objective function
np complete
constraint satisfaction
decomposition methods