Bounded width problems and algebras
From MaRDI portal
Publication:997127
DOI10.1007/s00012-007-2012-6zbMath1120.08002MaRDI QIDQ997127
Publication date: 20 July 2007
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00012-007-2012-6
Related Items
Unnamed Item, Unnamed Item, Solving CSPs Using Weak Local Consistency, The Complexity of Valued CSPs, Algebra and the Complexity of Digraph CSPs: a Survey, Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs, Unnamed Item, The Power of Sherali--Adams Relaxations for General-Valued CSPs, Binarisation for Valued Constraint Satisfaction Problems, Recent Results on the Algebraic Approach to the CSP, Dualities for Constraint Satisfaction Problems, The lattice of clones of self-dual operations collapsed, Optimal strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties, Equivariant algorithms for constraint satisfaction problems over coset templates, On solvability of systems of polynomial equations, The complexity of the list homomorphism problem for graphs, A new line of attack on the dichotomy conjecture, CSP duality and trees of bounded pathwidth, Universal algebra and hardness results for constraint satisfaction problems, Affine systems of equations and counting infinitary logic, On the complexity of \(\mathbb{H}\)-coloring for special oriented trees, The wonderland of reflections, A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties, On digraph coloring problems and treewidth duality, Majority constraints have bounded pathwidth duality, Decidability of absorption in relational structures of bounded width., THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA, Robustly Solvable Constraint Satisfaction Problems, CSP DICHOTOMY FOR SPECIAL POLYADS, OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT, Sherali-Adams Relaxations for Valued CSPs
