boolean operation

(redirected from Boolean function)
Also found in: Thesaurus, Encyclopedia, Wikipedia.

Bool′ean opera′tion



n.
any logical operation in which each of the operands and the result take one of two values, as “true” and “false” or “circuit on” and “circuit off.”
[1960–65]
Bool′ean op′erator, n.
Random House Kernerman Webster's College Dictionary, © 2010 K Dictionaries Ltd. Copyright 2005, 1997, 1991 by Random House, Inc. All rights reserved.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.boolean operation - an operation that follows the rules of Boolean algebra; each operand and the result take one of two values
binary arithmetic operation, binary operation
operation - (computer science) data processing in which the result is completely specified by a rule (especially the processing that results from a single instruction); "it can perform millions of operations per second"
Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton University, Farlex Inc.
Mentioned in ?
References in periodicals archive ?
The study of innovation in design algorithms for S-boxes witnesses that the change of model and the selection of Boolean function contribute little to the performance indices of an S-box.
To Study the Effect of the Generating Polynomial on the Quality of Nonlinear Components in Block Ciphers
Here, [B.sub.i] (i=1,2, ..., m) is a basic primitive; and G is a regular Boolean function whose operations have forms [[intersection].sup.*], [[union].sup.*], and --*.
Path Planning with Obstacle Avoidance Based on Normalized R-Functions
Since MUX is a universal logic block; a fc-input LUT can implement any fc-variable Boolean function. Several LUTs are grouped together to form larger aggregates called Configurable Logic Blocks (CLBs) or simply clusters.
Exploring Shared SRAM Tables in FPGAs for Larger LUTs and Higher Degree of Sharing
Dynamics of BN is introduced by assigning a Boolean state variable and a Boolean function to each node.
Interpolative Boolean Networks
There exists a dialect [L.sub.m](n([summation])) such that each proper binary boolean function ([L.sub.m]([summation]) o ([L.sub.n]([pi]([summation])) has maximal complexity for all m, n [??] k.
Most complex regular ideal languages
This function is precisely the well-known parity Boolean function, having a very high complexity among the set of Boolean functions [19].
The generalization complexity measure for continuous input data
It follows from [31] that the Boolean function of rule 24 is
Chaotic behavior of one-dimensional cellular automata rule 24

Dictionary browser ?
Full browser ?