Live briefing
Everything about Boolean circuit
Model of computation
In computational complexity theory and circuit complexity, a Boolean circuit is a mathematical model for combinational digital logic circuits. A formal language can be decided by a family of Boolean circuits, one circuit for each possible input length. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Boolean circuitA 5-minute orientation
- Skim a recent paper: Realization of Complete Boolean Logic and Combinational Logic Functionalities on a Memristor-Based Universal Logic CircuitInfluential work since 2022
- Pick up a classic book: Digital CircuitsThe most-reprinted book on the subject
- Read the landmark paper: Application of Boolean algebra to switching circuit design and to error detectionCited 406 times
- Go sideways: Circuit complexityA closely related topic
- Go sideways: Complexity classA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Application of Boolean algebra to switching circuit design and to error detection
The monotone circuit complexity of boolean functions
On Circuit Functionality in Boolean Networks
Easily Cascaded Memristor-CMOS Hybrid Circuit for High-Efficiency Boolean Logic Implementation
Asynchronous circuit synthesis with Boolean satisfiability
Reversible Circuit Optimization Via Leaving the Boolean Domain
Bounds on an exponential sum arising in Boolean circuit complexity
New upper bounds on the Boolean circuit complexity of symmetric functions
🆕 Influential since 2022
Realization of Complete Boolean Logic and Combinational Logic Functionalities on a Memristor-Based Universal Logic Circuit
A Novel Hypercube-Based Heuristic for Quantum Boolean Circuit Synthesis
Optimizing the Quantum Circuit for Solving Boolean Equations Based on Grover Search Algorithm
A New Multicommodity Network Flow Model and Branch and Cut for Optimal Quantum Boolean Circuit Synthesis
Detecting Affine Equivalence Of Boolean Functions And Circuit Transformation
📚 Books worth reading
- 📕Digital CircuitsAmalou Abdelilah · 1989
Communication complexityEyal Kushilevitz, Noam Nisan · 2006
Electronic switching circuitsMatthew Mandl · 1969
Boolean algebra for computer logicHarold E. Ennes · 1978- 📕Exercices de calcul booléien avec leurs solutionsMaurice Denis-Papin · 1966
- 📕Digital systems logic and circuitsB. Zacharov · 1968
Logical design of electrical circuitsRené A. Higonnet · 1958
Communication complexityMauricio Karchmer · 1989
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Circuit complexity In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- P (complexity) In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can…
- P/poly In computational complexity theory, P/poly is a complexity class that can be defined in both circuit complexity and non-uniform complexity. Since the two…
- TC0 In theoretical computer science, and specifically computational complexity theory and circuit complexity, TC0 (Threshold Circuit) is the first class in…
- NC (complexity) Unsolved problem in computer science 𝖭𝖢=?𝖯 More unsolved problems in computer science In computational complexity theory, the class NC (for Nick's…
- Circuit (computer science) In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes…
- Advice (complexity) In computational complexity theory, an advice string is an extra input to a Turing machine that is allowed to depend on the length n of the input, but…