Pages that link to "Item:Q5283238"
From MaRDI portal
The following pages link to The Complexity of General-Valued CSPs (Q5283238):
Displaying 24 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Piecewise linear valued constraint satisfaction problems with fixed number of variables (Q2056915) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← 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)
- (Q5089260) (← links)
- Sparsification of Binary CSPs (Q5090464) (← links)
- (Q5090503) (← links)
- (Q5091214) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- The Complexity of Quantified Constraints Using the Algebraic Formulation (Q5111241) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Sparsification of Binary CSPs (Q5220474) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)
