# Boolean circuit

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- IACR Cryptology ePrint Archive
- 2016

In this paper we describe ZKBoo, a proposal for practically efficient zeroknowledge arguments especially tailored for Booleanâ€¦Â (More)

Is this relevant?

Highly Cited

2015

Highly Cited

2015

- IEEE Symposium on Security and Privacy
- 2015

We introduce Tiny Garble, a novel automated methodology based on powerful logic synthesis techniques for generating andâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

Boolean circuits are used to represent programs on finite data. Reversible Boolean circuits and quantum Boolean circuits haveâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 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)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

Let us imagine children playing with a box containing a large number of building blocks such as LEGOTM, fischertechnikï›š, Polydronâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- FOCS
- 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

- FOCS
- 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

- STOC
- 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

- FOCS
- 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

- STOC
- 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)

Is this relevant?