Add to ORKGThe clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaing clones are not weakly reconstructible
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions f0; 1...
A clone is a set of finitary operations closed under composition and contain- ing all projections. W...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
International audienceThe clones of Boolean functions are classified in regard to set-reconstructibi...
AbstractWe characterize Post classes of Boolean functions (also known as clones) in terms of forbidd...
Abstract—This paper is a contribution to the understanding of the relation between pivotal decomposi...
The classcompositionC∘K of Boolean clones, being the set of composite functionsf(g1,…,gn) with f∈C, ...
International audienceThis paper is a contribution to the understanding of the relation between pivo...
AbstractFor each clone C on a set A there is an associated equivalence relation, called C-equivalenc...
AbstractThe class composition C∘K of Boolean clones, being the set of composite functions f(g1,…,gn)...
We present some compositions of clones of Boolean functions that imply factorizations of Ω, the clon...
For each clone C on a set A there is an associated equivalence relation, called C-equivalence, on th...
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the n...
The unifying theme of this research work is functional composition. We study operations on a nonempt...
AbstractKuznecov introduced the concept of primitive positive clones and proved in 1977 that there a...
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions f0; 1...
A clone is a set of finitary operations closed under composition and contain- ing all projections. W...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...
International audienceThe clones of Boolean functions are classified in regard to set-reconstructibi...
AbstractWe characterize Post classes of Boolean functions (also known as clones) in terms of forbidd...
Abstract—This paper is a contribution to the understanding of the relation between pivotal decomposi...
The classcompositionC∘K of Boolean clones, being the set of composite functionsf(g1,…,gn) with f∈C, ...
International audienceThis paper is a contribution to the understanding of the relation between pivo...
AbstractFor each clone C on a set A there is an associated equivalence relation, called C-equivalenc...
AbstractThe class composition C∘K of Boolean clones, being the set of composite functions f(g1,…,gn)...
We present some compositions of clones of Boolean functions that imply factorizations of Ω, the clon...
For each clone C on a set A there is an associated equivalence relation, called C-equivalence, on th...
An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the n...
The unifying theme of this research work is functional composition. We study operations on a nonempt...
AbstractKuznecov introduced the concept of primitive positive clones and proved in 1977 that there a...
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions f0; 1...
A clone is a set of finitary operations closed under composition and contain- ing all projections. W...
Achieving a classification of all clones of operations over a finite set is one of the goals at the ...