Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[КНИГА][B] Boolean functions: Theory, algorithms, and applications
Y Crama, PL Hammer - 2011 - books.google.com
Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …
unified presentation of the structural, algorithmic and applied aspects of the theory of …
[HTML][HTML] Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
Z Igor'E - Discrete Applied Mathematics, 2005 - Elsevier
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and
Post classes - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books …
Post classes - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books …
On a quasi-ordering on Boolean functions
It was proved few years ago that classes of Boolean functions definable by means of
functional equations [O. Ekin, S. Foldes, PL Hammer, L. Hellerstein, Equational …
functional equations [O. Ekin, S. Foldes, PL Hammer, L. Hellerstein, Equational …
[HTML][HTML] Composition of Post classes and normal forms of Boolean functions
The class composition C∘ K of Boolean clones, being the set of composite functions f (g1,…,
gn) with f∈ C, g1,…, gn∈ K, is investigated. This composition C∘ K is either the join C∨ K …
gn) with f∈ C, g1,…, gn∈ K, is investigated. This composition C∘ K is either the join C∨ K …
Functional equations, constraints, definability of function classes, and functions of Boolean variables
The paper deals with classes of functions of several variables defined on an arbitrary set A
and taking values in a possibly different set B. Definability of function classes by functional …
and taking values in a possibly different set B. Definability of function classes by functional …
Join-irreducible Boolean functions
This paper is a contribution to the study of a quasi-order on the set Ω of Boolean functions,
the simple minor quasi-order. We look at the join-irreducible members of the resulting poset …
the simple minor quasi-order. We look at the join-irreducible members of the resulting poset …
On the lattice of equational classes of Boolean functions and its closed intervals
M Couceiro - arxiv preprint arxiv:1105.3452, 2011 - arxiv.org
Let A be a finite set with at least two elements. The composition of two classes I and J of
operations on A, is defined as the set of all compositions of functions in I with functions in J …
operations on A, is defined as the set of all compositions of functions in I with functions in J …
[HTML][HTML] Definability of Boolean function classes by linear equations over GF (2)
Necessary and sufficient conditions are provided for a class of Boolean functions to be
definable by a set of linear functional equations over the two-element field. The conditions …
definable by a set of linear functional equations over the two-element field. The conditions …
An algorithm for producing median formulas for Boolean functions
We review various normal form representations of Boolean functions and outline a
comparative study between them, which shows that the median normal form system …
comparative study between them, which shows that the median normal form system …
[HTML][HTML] Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
Each clone C on a fixed base set A induces a quasi-order on the set of all operations on A
by the following rule: f is a C-minor of g if f can be obtained by substituting operations from C …
by the following rule: f is a C-minor of g if f can be obtained by substituting operations from C …