The following pages link to The Complexity of Valued CSPs (Q4993602):
Displaying 8 items.
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- On planar valued CSPs (Q2396724) (← links)
- An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains (Q2674328) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
