Skip to search formSkip to main contentSkip to account menu

Boolean circuit

Known as: Boolean, Boolean circuits, Circuit 
In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for digital logic circuits. A formal language… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
AC (complexity)AND gateAdder (electronics)Advice (complexity)

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Intuitionistic fuzzy filter theory of BL-algebras
In this paper, the intuitionistic fuzzy filter theory of BL-algebras is researched. The basic knowledge of BL-algebras and… 
Highly Cited
2012
Highly Cited
2012
New Methodology for the Design of Efficient Binary Addition Circuits in QCA
The quantum-dot cellular automata (QCA) approach is an attractive emerging technology suitable for the development of ultradense… 
2006
2006
Dependency Quantified Horn Formulas: Models and Complexity
Dependency quantified Boolean formulas (DQBF) extend quantified Boolean formulas with Henkin-style partially ordered quantifiers… 
2005
2005
On Global Dynamic Behavior of Weakly Connected Oscillatory Networks
The global dynamics of weakly connected oscillatory networks is investigated: as a case study, one-dimensional arrays of third… 
Review
2005
Review
2005
A survey on piecewise-linear models of regulatory dynamical systems
Highly Cited
1998
Highly Cited
1998
DNA simulation of boolean circuits
In this paper we describe a simulation of Boolean circuits using standard bio-molecular techniques. Previously proposed… 
1993
1993
Peirce algebras
We present a two-sorted algebra, called aPeirce algebra, of relations and sets interacting with each other. In a Peirce algebra… 
Highly Cited
1992
Highly Cited
1992
Equivalence of robust delay-fault and single stuck-fault test generation
A link between the problems of robust delay-fault and single stuck-fault test generation is established. In particular, it is… 
1989
1989
On Restricted Boolean Circuits
We consider some classes of restricted Boolean circuits: synchronous and locally synchronous circuits, planar circuits, formulas… 
1965
1965
Synthesis of Minimal Threshold Logic Networks
An algorithm is developed for synthesizing networks which realize Boolean switching functions through the use of a minimum number… 
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)