Pages that link to "Item:Q5470737"

The following pages link to The Approximability of Three-valued MAX CSP (Q5470737):

Displaying 18 items.

• Enumerating homomorphisms (Q414933) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
• On the complexity of submodular function minimisation on diamonds (Q665998) (← 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)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• The Expressive Power of Binary Submodular Functions (Q3182971) (← links)
• Conditional Hardness of Approximating Satisfiable Max 3CSP-q (Q3652279) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom (Q5326612) (← links)
• Introduction to the Maximum Solution Problem (Q5504706) (← links)