Pages that link to "Item:Q315529"

The following pages link to Complexity of approximating CSP with balance/hard constraints (Q315529):

Displaying 2 items.

• Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
• Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)