Boolean function


Also found in: Dictionary, Thesaurus, Wikipedia.

Boolean function

[′bü·lē·ən ′fəŋk·shən]
(mathematics)
A function f (x,y,…,z) assembled by the application of the operations AND, OR, NOT on the variables x, y,…, z and elements whose common domain is a Boolean algebra.
References in periodicals archive ?
where [mathematical expression not reproducible] and each of [s.sub.i]'s is regarded as a component Boolean function.
Reis, "Classifying n-input Boolean functions," VII Workshop Iberchip, 2001.
Let f(x) : [F.sup.n.sub.2] [right arrow] [F.sub.2] be an n Boolean function; the nonlinearity of f(x) can take the following form:
, [x.sub.m]) [member of] {0,1} is a Boolean function, and h(v;) [member of] [0,1] is the Hill function.
(a) Network topological structure; (b) the definition of Boolean functions; (c) state transition of Boolean network.
For any proper binary boolean function o, the complexity of [L.sub.m] (a, -, c, -, e) [??] [L.sub.n](a, -, e, -, c) is mn.
Wegener, The Complexity of Boolean Functions, John Wiley & Sons, 1987.
TABLE 1: The truth table of Boolean function of rule 24.
When the relationship is defined by a Boolean function as in (1), the conditional distribution in (2) take the form of a binomial distribution (or a multinomial distribution when both regulators and target take more than two states).
c) The procedures of translations of a Boolean function f([k.sub.1],[k.sub.2],...,[k.sub.n]) of random keywords in a union of atoms are extremely simple.
Definition 5 Hamming Weight: Number of Boolean 1's in a Boolean function's truth table is called the Hamming weight of the function.
Within the last two decades binary decision diagrams (BDD) have become the state-of-the-art data structure in VLSI CAD for representation and manipulation of Boolean functions [18-25].