The following pages link to (Q2913811):
Displayed 4 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Nearly Optimal NP-Hardness of Unique Coverage (Q5269824) (← links)