Top-Down Lower Bounds for Depth-Four Circuits

Mika Göös, Artur Riazanov, Anastasia Sofronova +1

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$ cir…