On algebras with many symmetric operations
From MaRDI portal
Publication:2821826
DOI10.1142/S0218196716500429zbMath1352.08002arXiv1406.5061OpenAlexW2964190293MaRDI QIDQ2821826
Catarina A. Carvalho, Andrei A. Krokhin
Publication date: 23 September 2016
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.5061
Structure theory of algebraic structures (08A05) Operations and polynomials in algebraic structures, primal algebras (08A40) Equational classes, universal algebra in model theory (03C05)
Related Items (2)
Towards a characterization of constant-factor approximable finite-valued CSPs ⋮ Submaximal clones over a three-element set up to minor-equivalence
Cites Work
- Unnamed Item
- Unnamed Item
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- A new line of attack on the dichotomy conjecture
- Universal algebra and hardness results for constraint satisfaction problems
- On \(n\)-permutable congruences
- Linear programming, width-1 CSPs, and robust satisfaction
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
- Robust Satisfiability for CSPs
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- The structure of finite algebras
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Classifying the Complexity of Constraints Using Finite Algebras
- Robust satisfiability of constraint satisfaction problems
- Recent Results on the Algebraic Approach to the CSP
- Dualities for Constraint Satisfaction Problems
This page was built for publication: On algebras with many symmetric operations