Top-Down Lower Bounds for Depth-Four Circuits
Computational Complexity
2024-05-03 v2
Abstract
We present a top-down lower-bound method for depth- boolean circuits. In particular, we give a new proof of the well-known result that the parity function requires depth- circuits of size exponential in . Our proof is an application of robust sunflowers and block unpredictability.
Keywords
Cite
@article{arxiv.2304.02555,
title = {Top-Down Lower Bounds for Depth-Four Circuits},
author = {Mika Göös and Artur Riazanov and Anastasia Sofronova and Dmitry Sokolov},
journal= {arXiv preprint arXiv:2304.02555},
year = {2024}
}