Pages that link to "Item:Q3064168"
From MaRDI portal
The following pages link to The complexity of global cardinality constraints (Q3064168):
Displayed 7 items.
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- (Q5090503) (← links)
- Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)