The following pages link to (Q3365840):
Displaying 27 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Dualities and algebras with a near-unanimity term (Q312213) (← links)
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Complexity of the satisfiability problem for multilinear forms over a finite field (Q682219) (← links)
- The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- Closed sets of finitary functions between products of finite fields of coprime order (Q2057102) (← links)
- Closed sets of finitary functions between finite fields of coprime order (Q2210121) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- The constraint satisfaction problem and universal algebra (Q2795309) (← links)
- Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem (Q2881074) (← links)
- CSP dichotomy for special triads (Q3395563) (← links)
- Constraint Satisfaction Problems over the Integers with Successor (Q3448790) (← links)
- The complexity of homomorphism and constraint satisfaction problems seen from the other side (Q3546332) (← links)
- Complexity of Constraint Satisfaction Problems over Finite Subsets of Natural Numbers. (Q4608591) (← links)
- Expansions of abelian square-free groups (Q5002190) (← links)
- (Q5109509) (← links)
- CSPs with global modular constraints: algorithms and hardness via polynomial representations (Q5212801) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
- The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)
- On congruence lattices of algebras with an operator and the symmetric main operation (Q6570124) (← links)
