Circuit complexity

Known as: Uniform circuit complexity, Uniformity (circuit), P-nonuniform 
In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
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)
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
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
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
Preface This book should be of interest to anyone who would like to understand computation from the point of view of logic. The… (More)
  • figure 1.1
  • figure 1.11
  • table 1.19
  • figure 2.13
  • figure 2.21
Is this relevant?
Highly Cited
1994
Highly Cited
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
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
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
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
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
We consider uniform circuit complexity, introduced by Borodin as a model of parallel complexity. Three main results are presented… (More)
Is this relevant?