New tractable classes from old
From MaRDI portal
Recommendations
Cited in
(18)- Characterising tractable constraints
- Disjunctions, independence, refinements
- A new tractable class of constraint satisfaction problems
- Partition search for non-binary constraint satisfaction
- Tractability in constraint satisfaction problems: a survey
- Building tractable disjunctive constraints
- Typed Guarded Decompositions for Constraint Satisfaction
- The Effect of Constraint Representation on Structural Tractability
- Refinements and independence: A simple method for identifying tractable disjunctive constraints
- New tractable classes from old
- Exploiting bipartiteness to identify yet another tractable subclass of CSP
- Some new tractable classes of CSPs and their relations with backtracking algorithms
- An algebraic approach to multi-sorted constraints
- Tractability by approximating constraint languages
- Principles and Practice of Constraint Programming – CP 2004
- Tractable constraints on ordered domains
- A polynomial relational class of binary CSP
- A hybrid tractable class for non-binary CSPs
This page was built for publication: New tractable classes from old
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424765)