Top-Down Lower Bounds for Depth-Four Circuits
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914779588722688 |
|---|---|
| author | Göös, Mika Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry |
| author_facet | Göös, Mika Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry |
| contents | 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 $n^{1/3}$. Our proof is an application of robust sunflowers and block unpredictability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_02555 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Top-Down Lower Bounds for Depth-Four Circuits Göös, Mika Riazanov, Artur Sofronova, Anastasia Sokolov, Dmitry Computational Complexity 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 $n^{1/3}$. Our proof is an application of robust sunflowers and block unpredictability. |
| title | Top-Down Lower Bounds for Depth-Four Circuits |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2304.02555 |