# Circuit complexity

## Papers overview

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

Highly Cited

2014

Highly Cited

2014

- STOC
- 2014

We present a new randomized method for computing the min-plus product (a.k.a., tropical product) of two <i>n</i> Ã— <i>n</iâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- STOC
- 2009

We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted dataâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- 1999

Thank you very much for reading introduction to circuit complexity a uniform approach. As you may know, people have searchâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Graduate Texts in Computer Science
- 1999

Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- 1994

Of course, from childhood to forever, we are always thought to love reading. It is not only reading the lesson book but alsoâ€¦Â (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

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

1987

Highly Cited

1987

- Combinatorica
- 1987

Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that lect cliques in graphs. In particularâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- STOC
- 1983

It is shown that for every k, polynomial-size, depth-k Boolean circuits are more powerful than polynomial-size, depth-(kâˆ’1â€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- 20th Annual Symposium on Foundations of Computerâ€¦
- 1979

We consider uniform circuit complexity, introduced by Borodin as a model of parallel complexity. Three main results are presentedâ€¦Â (More)

Is this relevant?