We present a top-down lower-bound method for depth-4 boolean circuits. In particular, we give a new proof of the well-known result that the parity function requires depth-4 circuits of size exponential in n1/3. Our proof is an application of robust sunflowers and block unpredictability.
Joint work with Artur Riazanov, Anastasia Sofronova, and Dmitry Sokolov. It relates to this arXiv paper.
This video was produced by the Simons Institute, and forms part of the workshop Structural Results.
