Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > TOP-DOWN LOWER BOUNDS:
Reports tagged with top-down lower bounds:
TR26-221 | 30th September 2026
Oliver Korten

Top-Down Lower Bounds for All Depths

We prove that Parity requires $2^{n^{\Omega(1)}}$ size De Morgan circuits of constant depth using a new method which is completely “top-down” in the sense of [HJP95]. The proof relies crucially on the core ideas developed in a line of work [HJP95, PPZ99, MW19, GRSS24] which previously established top-down lower bounds ... more >>>




ISSN 1433-8092 | Imprint