The complexity of constraint satisfaction problems (invited talk)
From MaRDI portal
Recommendations
- Methods and Applications of Artificial Intelligence
- Tractability in constraint satisfaction problems: a survey
- Asking the Metaquestions in Constraint Tractability
- Classifying the Complexity of Constraints Using Finite Algebras
- Constraint satisfaction tractability from semi-lattice operations on infinite sets
Cited in
(17)- Constants and finite unary relations in qualitative constraint reasoning
- Complexity of combinations of qualitative constraint satisfaction problems
- Constraint satisfaction with succinctly specified relations
- Dismantlability, connectedness, and mixing in relational structures
- Semilattice polymorphisms and chordal graphs
- On the scope of the universal-algebraic approach to constraint satisfaction
- Constraint satisfaction tractability from semi-lattice operations on infinite sets
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- The complexity of temporal constraint satisfaction problems
- Finite unary relations and qualitative constraint satisfaction
- Satisfiability: where Theory meets Practice (Invited Talk).
- Tractable set constraints
- Dismantlability, Connectedness, and Mixing in Relational Structures
- An initial study of time complexity in infinite-domain constraint satisfaction
- Methods and Applications of Artificial Intelligence
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Constraint Satisfaction Problems with Infinite Templates
This page was built for publication: The complexity of constraint satisfaction problems (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954979)
