A complete classification of Constraint Languages generated by binary entropic minimal clones
نویسنده
چکیده
While finishing this paper I found the paper [9] which proves that a binary operation that is generates a minimal clone is NP-complete is the operation is non-commutative and is polynomial if the operation is equivalent to a commutative operation that generates the clone. From this result all results in this paper can be (even more) trivially proved. This paper might be of interest to some readers as an introduction to the theory of the complexity of constraint satisfaction problems.
منابع مشابه
Characterising Tractable Constraints
Finding solutions to a binary constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph structure is restricted. This paper considers restricted sets of contraints which are closed under permutation of the labels. We identify a set of constraints which gives rise to a class of tractabl...
متن کاملA Galois Connection for Valued Constraint Languages of Infinite Size
A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen et al. established a Galois connection between finitely-generated weighted clones and finitely-generated weighted relational clones [SICOMP’13], and asked whe...
متن کاملMaximal Infinite-Valued Constraint Languages
We systematically investigate the computational complexity of constraint satisfaction problems for constraint languages over an infinite domain. In particular, we study a generalization of the well-established notion of maximal constraint languages from finite to infinite domains. If the constraint language can be defined with an ω-categorical structure, then maximal constraint languages are in...
متن کاملCompressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کاملThe Complexity of Temporal Constraint Languages
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal constraint languages, then the CSP can be solved in pol...
متن کامل