Pages that link to "Item:Q3524237"

The following pages link to An Algebraic Characterisation of Complexity for Valued Constraint (Q3524237):

Displaying 11 items.

• Classes of submodular constraints expressible by graph cuts (Q606899) (← 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)
• A note on some collapse results of valued constraints (Q987814) (← links)
• Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• The Expressive Power of Valued Constraints: Hierarchies and Collapses (Q3523088) (← links)
• Soft Constraints Processing over Divisible Residuated Lattices (Q3638207) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• Introduction to the Maximum Solution Problem (Q5504706) (← links)