Principles and Practice of Constraint Programming – CP 2004
From MaRDI portal
Publication:5900292
DOI10.1007/b100482zbMath1152.68546OpenAlexW1508891358MaRDI QIDQ5900292
Publication date: 9 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100482
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
The complexity of constraint satisfaction games and QCSP ⋮ On the Complexity of the Model Checking Problem ⋮ First-Order Model Checking Problems Parameterized by the Model ⋮ Quantified Constraints in Twenty Seventeen ⋮ Unnamed Item ⋮ Existentially restricted quantified constraint satisfaction