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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper we describe ZKBoo, a proposal for practically efficient zeroknowledge arguments especially tailored for Boolean… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We introduce Tiny Garble, a novel automated methodology based on powerful logic synthesis techniques for generating and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Boolean circuits are used to represent programs on finite data. Reversible Boolean circuits and quantum Boolean circuits have… (More)
  • figure 9
  • figure 13
  • figure 14
  • figure 16
  • figure 17
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The development of an entire organism from a single cell is one of the most profound and awe inspiring phenomena in the whole of… (More)
  • figure 2.1
  • figure 5.1
  • figure 5.2
  • figure 5.3
  • figure 5.4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Let us imagine children playing with a box containing a large number of building blocks such as LEGOTM, fischertechnik, Polydron… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Why should wait for some days to get or receive the quantum circuit complexity book that you order? Why should you take it if you… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We prove that any language in ACC can be approximately computed by two-level circuits of size 2('Ogn)', with a symmetric-function… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fan-in… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We present optimal depth Boolean circuits (depth O(log n)) for integer division, powering and multiple products We also show tha… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
We show that there is a combinational (acyclic) Boolean circuit of complexity 0(slog s), that can be made to compute any Boolean… (More)
  • figure 3
Is this relevant?