Pages that link to "Item:Q3546290"
From MaRDI portal
The following pages link to A dichotomy theorem for constraint satisfaction problems on a 3-element set (Q3546290):
Displaying 41 items.
- The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
- Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
- On the Computational Complexity of Monotone Constraint Satisfaction Problems (Q3605505) (← links)
- On m-Junctive Predicates on a Finite Set (Q4973259) (← links)
- (Q4993594) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- (Q5028466) (← links)
- (Q5089174) (← links)
- (Q5090503) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism (Q5096588) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- (Q5136286) (← links)
- On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
- Quantified Constraint Satisfaction Problem on Semicomplete Digraphs (Q5278200) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- (Q5743434) (← links)
- (Q5863854) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5918683) (← links)
- Bipartite 3-regular counting problems with mixed signs (Q5925701) (← links)
- (Q6193828) (← links)
