The following pages link to New tractable classes from old (Q1424765):
Displaying 11 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- A polynomial relational class of binary CSP (Q722101) (← links)
- A hybrid tractable class for non-binary CSPs (Q903910) (← links)
- Characterising tractable constraints (Q1321064) (← links)
- Disjunctions, independence, refinements (Q1614865) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- Building tractable disjunctive constraints (Q2946994) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897196) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897210) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900293) (← links)