The following pages link to Bounded width problems and algebras (Q997127):
Displayed 31 items.
- Optimal strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties (Q334968) (← links)
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- On solvability of systems of polynomial equations (Q539980) (← 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)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- The wonderland of reflections (Q1709740) (← links)
- A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties (Q1991583) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Majority constraints have bounded pathwidth duality (Q2427535) (← links)
- Decidability of absorption in relational structures of bounded width. (Q2510713) (← links)
- THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA (Q2795309) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- CSP DICHOTOMY FOR SPECIAL POLYADS (Q2852579) (← links)
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT (Q3398315) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- (Q4993594) (← links)
- (Q4993595) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- Algebra and the Complexity of Digraph CSPs: a Survey (Q4993603) (← links)
- Solving CSPs Using Weak Local Consistency (Q5009788) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- (Q5377468) (← links)
- Recent Results on the Algebraic Approach to the CSP (Q5504700) (← links)
- Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
- The lattice of clones of self-dual operations collapsed (Q6116396) (← links)