Pages that link to "Item:Q935141"

The following pages link to Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141):

Displaying 15 items.

• Modularity-based decompositions for valued CSP (Q353312) (← links)
• Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• Hybrid tractability of valued constraint problems (Q646503) (← links)
• The complexity of approximating conservative counting CSPs (Q743130) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• On planar valued CSPs (Q2396724) (← links)
• A complexity classification of spin systems with an external field (Q2962306) (← links)
• Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• A Representation Theorem for Union-Difference Families and Application (Q5458554) (← links)
• (Q5743434) (← links)