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 11 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)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- (Q5743434) (← links)
- (Q5874535) (← links)