Pages that link to "Item:Q2389649"
From MaRDI portal
The following pages link to Domain permutation reduction for constraint satisfaction problems (Q2389649):
Displaying 9 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
- Automatic generation of redundant models for permutation constraint satisfaction problems (Q2460256) (← links)
- The Broken-Triangle Property with Adjoint Values (Q4632206) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- (Q5136286) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897210) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900321) (← links)