Pages that link to "Item:Q5897196"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2003 (Q5897196):
Displaying 19 items.
- A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Algebraic geometry in first-order logic (Q1040258) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- An interactive algorithm for multiple criteria constrained sorting problem (Q1615969) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Constraint satisfaction problems over semilattice block Mal'tsev algebras (Q2272992) (← links)
- Properties of tree convex constraints (Q2389670) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- A Further Generalized Kettele Algorithm with Multiple Constraints (Q3202105) (← links)
- Algebraic properties of multilinear constraints (Q4358474) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- Aggregation of Votes with Multiple Positions on Each Issue (Q5283212) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897200) (← links)
- Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)
