Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Complexity of tree homomorphisms
Discrete Applied Mathematics
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Closure properties of constraints
Journal of the ACM (JACM)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the algebraic structure of combinatorial problems
Theoretical Computer Science
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Generalized Majority-Minority Operations are Tractable
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
H-Coloring dichotomy revisited
Theoretical Computer Science - Graph colorings
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Complexity of K-tree structured constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Parameterized Complexity
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
Approximating fractional hypertree width
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Tricolorable torus knots are NP-complete
Proceedings of the 47th Annual Southeast Regional Conference
Hybrid tractable CSPs which generalize tree structure
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
On balanced CSPs with high treewidth
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Approximating fractional hypertree width
ACM Transactions on Algorithms (TALG)
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Does treewidth help in modal satisfiability?
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On guaranteeing polynomially bounded search tree size
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The tractability of CSP classes defined by forbidden patterns
Journal of Artificial Intelligence Research
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
Does Treewidth Help in Modal Satisfiability?
ACM Transactions on Computational Logic (TOCL)
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We give a survey of recent results on the complexity of constraint satisfaction problems. Our main emphasis is on tractable structural restrictions.