Pages that link to "Item:Q3451267"
From MaRDI portal
The following pages link to The approximability of MAX CSP with fixed-value constraints (Q3451267):
Displayed 6 items.
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)