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.
2019
2019
A data-driven method for quantifying the impact of a genetic circuit on its host
Genetic circuits aredesigned to implement certain logic in living cells, keeping burden on the host cell minimal. However… 
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
2002
2002
Systematic Generation of Current-Mode Linear Transformation Filters Based on Multiple Output CCIIs
A transformation called current-mode linear transformation (CMLT) and its filter applications using multiple output second… 
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… 
1973
1973
Multiple Addition by Residue Threshold Functions and Their Representation by Array Logic
In multioperand additions p summands can be compressed into q summands by adding along the columns independently. For a given… 
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… 
1961
1961
Bistable Systems of Differential Equations with Applications to Tunnel Diode Circuits
A mathematical analysis is developed for nonlinear circuits which have at least two stable steady states, and therefore are of… 
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)