Boolean function

(redirected from Boolean functions)
Also found in: 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 ?
The minimum of the Hamming distances between f and the Boolean functions in A is the nonlinearity off.
Some specific topics covered include construction of new toric quantum codes, an APN permutation in dimension six, and CCZ-equivalence of single- and multi-output Boolean functions.
On the probabilistic side we discuss applications of Fourier analysis of Boolean functions to the study of threshold behaviour of random graphs and other stochastic models, and propose ten directions for this emerging theory.
Boolean functions in coding theory and cryptography.
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].
A family of boolean functions is a sequence f = ([f.
Boolean functions -- searching for several words, subjects and so on in various combinations (for example "both x and y", "either x or y") -- are likewise possible, which helps to focus the search and make it more efficient.
The library is very rich in terms of Boolean functions, cell topologies and drive strengths.
Boolean functions in cryptology and information security; proceedings.
Keywords: And/Or trees, probability distribution for Boolean functions, tree enumeration
Some specific areas examined include the proof complexity of polynomial identities, fixed polynomial size circuit bounds, extractors for low-weight affine sources, Lipschitz continuous ordinary differential equations, and the complexity of Boolean functions in different characteristics.