Pages that link to "Item:Q3614209"
From MaRDI portal
The following pages link to Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction (Q3614209):
Displayed 9 items.
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- The expressive power of binary submodular functions (Q967393) (← links)
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196) (← links)
- A non-extendibility certificate for submodularity and applications (Q2019511) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)