arXiv (All)
open access
Top-Down Lower Bounds for All Depths
We prove that Parity requires $2^{n^{Ω(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-dow
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal Shallow Circuits for Majority#1119102
- Formalizing PARITY Circuit Lower Bounds in Lean#1050372
- Degree sequence condition for pancyclicity in tough graphs#1048854
- Jumping through the transfinite: The master code hierarchy of Turing degrees#740262
- Downhole temperature measurements from IODP Hole 315-C0002D#991489
Record · ID 1143278
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive