arXiv (All)
open access
A General Composition Theorem for Approximate Degree
A longstanding open question in Boolean function complexity asks whether approximate degree composes multiplicatively under block composition. Although a general multiplicative upper bound is known, matching lower bounds have previously been established only for restricted classes of functions. We r
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
- Instance complexity of Boolean functions#131197
- Efficient communication and indexicality#771757
- Compression of visual information in redundancy masking follows grouping and segmentation#643064
- BAIT: Boundary-Guided Disclosure Escalation via Self-Conditioned Reasoning#229423
- Witness Complexity of Short Descriptions: A Cryptographic Perspective#324831
Record · ID 1078210
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