Pages that link to "Item:Q2387428"

The following pages link to Supermodular functions and the complexity of MAX CSP (Q2387428):

Displaying 18 items.

• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
• Supermodularity in mean-partition problems (Q811892) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
• Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
• The expressive power of binary submodular functions (Q967393) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• Log-supermodular functions, functional clones and counting CSPs (Q2904771) (← links)
• A Survey on Covering Supermodular Functions (Q2971606) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• (Q3773931) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• STACS 2004 (Q5309696) (← links)
• Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region (Q5932864) (← links)