Recent Results on the Algebraic Approach to the CSP
From MaRDI portal
(Redirected from Publication:5504700)
Cites work
- H-coloring dichotomy revisited
- A Characterisation of First-Order Constraint Satisfaction Problems
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- A new tractable class of constraint satisfaction problems
- A Simple Algorithm for Mal'tsev Constraints
- A Subalgebra Intersection Property for Congruence Distributive Varieties
- Affine Systems of Equations and Counting Infinitary Logic
- Bounded width problems and algebras
- Classifying the Complexity of Constraints Using Finite Algebras
- Closure properties of constraints
- Combinatorial problems raised from 2-semilattices
- Constraints and universal algebra
- Constraints, consistency and closure
- Dualities for Constraint Satisfaction Problems
- Existence theorems for weakly symmetric operations
- Few subpowers, congruence distributivity and near-unanimity terms
- scientific article; zbMATH DE number 3972929 (Why is no real title available?)
- scientific article; zbMATH DE number 3987347 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 1944123 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2005
- On the algebraic structure of combinatorial problems
- On the complexity of H-coloring
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- Tame congruence theory
- The complexity of satisfiability problems
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The expressive rate of constraints
- The set of types of a finitely generated variety
- The structure of finite algebras
- Tractability and learnability arising from algebras with few subpowers
- Tractable Clones of Polynomials over Semigroups
- Universal Algebra and Hardness Results for Constraint Satisfaction Problems
- Varieties with few subalgebras of powers
Cited in
(24)- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
- Constraint satisfaction problems over semilattice block Mal'tsev algebras
- The number of clones determined by disjunctions of unary relations
- Characterizations of several Maltsev conditions.
- Commutative idempotent groupoids and the constraint satisfaction problem.
- A CSP search algorithm with responsibility sets and kernels
- Tractability in constraint satisfaction problems: a survey
- On algebras with many symmetric operations
- On the CSP Dichotomy Conjecture
- Nonnegative weighted \#CSP: an effective complexity dichotomy
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT
- Testing list H-homomorphisms
- List-homomorphism problems on graphs and arc consistency
- Algebra and the complexity of digraph CSPs: a survey
- Key (critical) relations preserved by a weak near-unanimity function
- Aggregation of votes with multiple positions on each issue
- Dualities for Constraint Satisfaction Problems
- Strong subalgebras and the constraint satisfaction problem
- Not all nilpotent monoids are finitely related
- Graphs of finite algebras: edges, and connectivity
- The complexity of the list homomorphism problem for graphs
- There are no pure relational width 2 constraint satisfaction problems
- CSP duality and trees of bounded pathwidth
This page was built for publication: Recent Results on the Algebraic Approach to the CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504700)
