Advertisement
Published in:
2012 | OriginalPaper | Chapter
Large-Depth Circuits
Author : Stasys Jukna
Published in: Boolean Function Complexity
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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