The following pages link to (Q2754150):
Displaying 39 items.
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Rigid binary relations on a 4-element domain (Q523155) (← links)
- Complexity of the satisfiability problem for multilinear forms over a finite field (Q682219) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
- Periodic constraint satisfaction problems: Tractable subclasses (Q816674) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Congruence modularity implies cyclic terms for finite algebras (Q1047112) (← links)
- A discrete homotopy theory for binary reflexive structures (Q1763635) (← links)
- A new tractable class of constraint satisfaction problems (Q1776199) (← links)
- Dichotomies for classes of homomorphism problems involving unary functions (Q1884913) (← links)
- On Maltsev digraphs (Q2260621) (← links)
- A quasi-Mal'cev condition with unexpected application. (Q2351514) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- The constraint satisfaction problem and universal algebra (Q2795309) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem (Q2881074) (← links)
- Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? (Q2946755) (← links)
- Reconstructing the topology of clones (Q2960444) (← links)
- On Maltsev Digraphs (Q3007626) (← links)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- CSP dichotomy for special triads (Q3395563) (← links)
- Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
- (Q4643956) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
- (Q5091214) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- An Algebraic Characterization of Testable Boolean CSPs (Q5326555) (← links)
- Constraint Satisfaction, Logic and Forbidden Patterns (Q5454246) (← links)
- Introduction to clones of functions (Q6594811) (← links)
