The Structure of Tractable Constraint Satisfaction Problems
From MaRDI portal
Publication:5756665
DOI10.1007/11821069_5zbMath1132.68700OpenAlexW1571197496MaRDI QIDQ5756665
Publication date: 5 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11821069_5
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (7)
Tractability in constraint satisfaction problems: a survey ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Linear Programs with Conjunctive Database Queries ⋮ Computational complexity of auditing finite attributes in statistical databases ⋮ Tractable structures for constraint satisfaction with truth tables ⋮ Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination ⋮ Time Complexity of Constraint Satisfaction via Universal Algebra
This page was built for publication: The Structure of Tractable Constraint Satisfaction Problems
