Large-Depth Circuits

  • Stasys Jukna
Part of the Algorithms and Combinatorics book series (AC, volume 27)


We now consider circuits of depth d ≥ 3. Out of attempts to prove lower bounds for such circuits, two powerful methods emerged. The first is a “depth reduction” argument: One tries to reduce the depth one layer at a time, until a circuit of depth 2 (or depth 1) remains. The key is the so-called Switching Lemma,which allows us to replace CNFs on the first two layers by DNFs, thus reducing the depth by 1.1


Boolean Function Parity Function Boolean Matrix Majority Gate Symmetric Boolean Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of FrankfurtFrankfurt am MainGermany
  2. 2.Institute of Mathematics and InformaticsVilnius UniversityVilniusLithuania

Personalised recommendations