The number of clones determined by disjunctions of unary relations
From MaRDI portal
Publication:2322711
DOI10.1007/s00224-018-9905-yzbMath1484.08003arXiv1811.11737OpenAlexW3099212081MaRDI QIDQ2322711
Mike Behrisch, Dmitriy N. Zhuk, Edith Vargas-García
Publication date: 5 September 2019
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.11737
Analysis of algorithms and problem complexity (68Q25) Operations and polynomials in algebraic structures, primal algebras (08A40) Many-valued logic (03B50) Relational systems, laws of composition (08A02)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finitely related clones and algebras with cube terms.
- Existence theorems for weakly symmetric operations
- Universal algebra and hardness results for constraint satisfaction problems
- On the complexity of H-coloring
- On the algebraic structure of combinatorial problems
- Unique inclusions of maximal C-clones in maximal clones
- Cube term blockers without finiteness
- Taylor's modularity conjecture and related problems for idempotent varieties
- Complexity of clausal constraints over chains
- Robustly Solvable Constraint Satisfaction Problems
- Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
- Near Unanimity Constraints Have Bounded Pathwidth Duality
- Clausal relations and {C}-clones
- Maximal and minimal C-monoids
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- A finer reduction of constraint problems to digraphs
- Varieties with few subalgebras of powers
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
- Term Rewriting and All That
- A Proof of the CSP Dichotomy Conjecture
- Quantified Constraint Satisfaction Problem on Semicomplete Digraphs
- Recent Results on the Algebraic Approach to the CSP
- Partial Polymorphisms and Constraint Satisfaction Problems
This page was built for publication: The number of clones determined by disjunctions of unary relations
