Pages that link to "Item:Q315529"
From MaRDI portal
The following pages link to Complexity of approximating CSP with balance/hard constraints (Q315529):
Displaying 3 items.
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← 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)
