Pages that link to "Item:Q5171200"
From MaRDI portal
The following pages link to Constraint Satisfaction Problems of Bounded Width (Q5171200):
Displayed 31 items.
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- List-homomorphism problems on graphs and arc consistency (Q393914) (← links)
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- Rigid binary relations on a 4-element domain (Q523155) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- Maltsev digraphs have a majority polymorphism (Q627926) (← links)
- The complexity of the list homomorphism problem for graphs (Q693060) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- Characterizations of several Maltsev conditions. (Q2351504) (← links)
- Commutative idempotent groupoids and the constraint satisfaction problem. (Q2351518) (← links)
- Decidability of absorption in relational structures of bounded width. (Q2510713) (← links)
- CSP for binary conservative relational structures (Q2634708) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- (Q4993594) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
- (Q5028466) (← links)
- Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy (Q5096441) (← links)
- Complexity and polymorphisms for digraph constraint problems under some basic constructions (Q5298320) (← links)
- (Q5743434) (← links)
- The smallest hard trees (Q6073305) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)