Constraint Satisfaction with Bounded Treewidth Revisited
From MaRDI portal
Publication:3524254
DOI10.1007/11889205_36zbMath1160.68563OpenAlexW2121895052MaRDI QIDQ3524254
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11889205_36
Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (9)
Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Constraint satisfaction with bounded treewidth revisited ⋮ Tensor network contractions for \#SAT ⋮ Algorithms for Propositional Model Counting ⋮ Complexity and Algorithms for Well-Structured k-SAT Instances ⋮ Tradeoffs in the Complexity of Backdoor Detection ⋮ Learning cluster-based structure to solve constraint satisfaction problems ⋮ Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search ⋮ Algorithms for propositional model counting
This page was built for publication: Constraint Satisfaction with Bounded Treewidth Revisited
