Pages that link to "Item:Q3177814"

The following pages link to The Complexity of Finite-Valued CSPs (Q3177814):

Displaying 44 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
• Minimum 0-extension problems on directed metrics (Q2042078) (← links)
• Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
• Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
• On planar valued CSPs (Q2396724) (← links)
• Universal qudit Hamiltonians (Q2662847) (← links)
• An application of Farkas' lemma to finite-valued constraint satisfaction problems over infinite domains (Q2674328) (← links)
• Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
• A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
• Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
• Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
• Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
• (Q4568111) (← links)
• Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
• (Q4993594) (← links)
• Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
• Backdoor Sets for CSP. (Q4993598) (← links)
• The Complexity of Valued CSPs (Q4993602) (← links)
• Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph (Q5002610) (← links)
• (Q5002776) (← links)
• The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
• The lattice and semigroup structure of multipermutations (Q5063206) (← links)
• (Q5089214) (← links)
• (Q5089260) (← links)
• (Q5090503) (← links)
• Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
• (Q5091252) (← links)
• Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
• Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
• Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
• Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
• Constant-Query Testability of Assignments to Constraint Satisfaction Problems (Q5232319) (← links)
• The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
• The Complexity of General-Valued CSPs (Q5283238) (← links)
• The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
• Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
• (Q5495840) (redirect page) (← links)
• CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
• Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
• Super-reparametrizations of weighted CSPs: properties and optimization perspective (Q6049436) (← links)
• Tractability of explaining classifier decisions (Q6098842) (← links)
• Valued constraint satisfaction problems (Q6602254) (← links)
• Generalized minimum 0-extension problem and discrete convexity (Q6665385) (← links)