The constraint satisfaction problem and universal algebra
From MaRDI portal
Recommendations
- Universal algebraic methods for constraint satisfaction problems
- Universal Algebra and Hardness Results for Constraint Satisfaction Problems
- Universal algebra and hardness results for constraint satisfaction problems
- On the scope of the universal-algebraic approach to constraint satisfaction
- scientific article; zbMATH DE number 1670830
- Constraints and universal algebra
- Time complexity of constraint satisfaction via universal algebra
- scientific article; zbMATH DE number 4162262
- The complexity of constraint satisfaction: an algebraic approach
- scientific article; zbMATH DE number 3872682
Cites work
- A Simple Algorithm for Mal'tsev Constraints
- A strong Mal'cev condition for locally finite varieties omitting the unary type
- An algebraic theory of complexity for discrete optimization.
- An effective dichotomy for the counting constraint satisfaction problem
- Bounded width problems and algebras
- CD(4) has bounded width
- Classifying the Complexity of Constraints Using Finite Algebras
- Closed systems of functions and predicates
- Closure properties of constraints
- Combinatorial problems raised from 2-semilattices
- Computational Complexity
- Existence theorems for weakly symmetric operations
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Meditations on quantified constraint satisfaction
- Nondeterministic Space is Closed under Complementation
- On the algebraic structure of combinatorial problems
- On the complexity of H-coloring
- On the Structure of Polynomial Time Reducibility
- Structure and importance of logspace-MOD class
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The method of forced enumeration for nondeterministic automata
- Universal algebra and hardness results for constraint satisfaction problems
- Varieties Obeying Homotopy Laws
- Varieties with few subalgebras of powers
Cited in
(24)- Axiomatisability and hardness for universal Horn classes of hypergraphs
- The wonderland of reflections
- On a stronger reconstruction notion for monoids and clones
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals
- Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
- Equivariant algorithms for constraint satisfaction problems over coset templates
- Proof Complexity Meets Algebra
- Absorption in universal algebra and CSP
- Constraint satisfaction problems over numeric domains
- The complexity of valued CSPs
- Maltsev conditions for general congruence meet-semidistributive algebras
- Universal algebraic methods for constraint satisfaction problems
- scientific article; zbMATH DE number 7559384 (Why is no real title available?)
- Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
- The Complexity of Boolean Surjective General-Valued CSPs
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
- Constant-query testability of assignments to constraint satisfaction problems
- Gap theorems for robust satisfiability: Boolean CSPs and beyond
- Universal algebraic methods for non-classical logics
- The complexity of the distributed constraint satisfaction problem
- Graphs of finite algebras: edges, and connectivity
- Exploring new topologies for the theory of clones
- Finite algebras with Hom-sets of polynomial size
This page was built for publication: The constraint satisfaction problem and universal algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795309)
