Login / Signup
On the Subexponential Time Complexity of CSP.
Iyad A. Kanj
Stefan Szeider
Published in:
AAAI (2013)
Keyphrases
</>
constraint satisfaction problems
computational complexity
np hard
constraint propagation
decision problems
constraint programming
high computational complexity