arXiv (All)
open access
Sumset Structure in Local Computation
We introduce and study a new model of decision trees that lies at the frontier of provable circuit lower bounds. We study $\ell$-local decision trees, in which each internal node queries an $\ell$-local function of the input. We show that sufficiently strong lower bounds for $\ell$-local decision
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
- On Circuit Imbalance and 0/1 Circuits for Coloring and Forest Problems#1104404
- Distributed Statistical Zero-Knowledge Proofs via Sumcheck#187288
- Many Circuits, One Mechanism: Input Variation and Evaluation Granularity in Circuit Discovery#677627
- Many Circuits, One Mechanism: Input Variation and Evaluation Granularity in Circuit Discovery#674427
- Embedding rooted blow-ups of tree posets#1049282
Record · ID 1037415
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