Rigid binary relations on a 4-element domain
From MaRDI portal
Publication:523155
DOI10.1007/s11083-016-9394-zzbMath1405.08001OpenAlexW2397983808MaRDI QIDQ523155
Publication date: 20 April 2017
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-016-9394-z
Operations and polynomials in algebraic structures, primal algebras (08A40) Relational systems, laws of composition (08A02)
Cites Work
- The effect of two cycles on the complexity of colourings by directed graphs
- Universal algebra and hardness results for constraint satisfaction problems
- On the algebraic structure of combinatorial problems
- Strongly rigid relations
- Closed systems of functions and predicates
- Minimal clones -- a minicourse
- On strong Mal'cev conditions for congruence meet-semidistributivity in a locally finite variety
- Note on projective graphs
- A Probabilistic Approach to the Dichotomy Problem
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Constraint Satisfaction Problems of Bounded Width
- The complexity of maximal constraint languages
- The complexity of satisfiability problems
- Complexity of the homomorphism extension problem in the random case
- Algebras which are independently generated by every n elements
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Rigid binary relations on a 4-element domain