Skip to search formSkip to main contentSkip to account menu

Boolean algebra

Known as: Boolean search, BooleanAlgebra, Boolean logic in computer science 
In mathematics and mathematical logic, Boolean algebra is the branch of algebra in which the values of the variables are the truth values true and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
A New Kind of ScienceAND gateAlgebraic normal formBinary data

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Assessment of Ambipolar Behavior of a Tunnel FET and Influence of Structural Modifications
In the present work, comprehensive investigation of the ambipolar characteristics of two silicon (Si) tunnel field-effect… 
Highly Cited
2005
Highly Cited
2005
Impulsive noise removal using threshold Boolean filtering based on the impulse detecting functions
A filter for impulsive noise removal is presented here. The problem of impulsive noise elimination is closely connected with the… 
Highly Cited
2003
Highly Cited
2003
A Funny Thing Happened on the Way to the Forum: Electronic Discussion and Foreign Language Learning.
Amongst the opportunities for cross-cultural contact created by the burgeoning use of the Internet are those provided by… 
Highly Cited
2002
Highly Cited
2002
Cryptographic properties of the Welch-Gong transformation sequence generators
Welch-Gong (WG) transformation sequences are binary sequences of period 2/sup n/ - 1 with two-level autocorrelation. These… 
Highly Cited
2001
Highly Cited
2001
Predictive mapping for management and conservation of seagrass beds in North Carolina
An Erratum has been published for this article in Aquatic Conservation: Marine and Freshwater Ecosystems 12(2), 2002 577 1… 
Highly Cited
1998
Highly Cited
1998
Demonstration of a six-dot quantum cellular automata system
We report an experimental demonstration of a logic cell for quantum-dot cellular automata (QCA). This nanostructure-based… 
Highly Cited
1993
Highly Cited
1993
A transitive closure algorithm for test generation
A transitive-closure-based test generation algorithm is presented. A test is obtained by determining signal values that satisfy a… 
Highly Cited
1992
Highly Cited
1992
Boolean matching using binary decision diagrams with applications to logic synthesis and verification
An algorithm for Boolean matching based on binary decision diagrams using a level-first search strategy is presented. This… 
Highly Cited
1975
Highly Cited
1975
Fault Detecting Test Sets for Reed-Muller Canonic Networks
Fault detecting test sets to detect multiple stuck-at-faults (s-a-faults) in certain networks, realizing Reed-Muller(RM) canonic… 
Highly Cited
1972
Highly Cited
1972
Easily Testable Realizations ror Logic Functions
Desirable properties of "easily testable networks" are given. A realization for arbitrary logic function, using AND and EXCLUSIVE… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)