Top-Down Lower Bounds for Depth-Four Circuits

Top-Down Lower Bounds for Depth-Four Circuits

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 unpredictabilit...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-04
Hauptverfasser: Göös, Mika, Riazanov, Artur, Sofronova, Anastasia, Sokolov, Dmitry
Format: Artikel
Sprache:eng
Schlagworte:
Circuits
Lower bounds
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422