arXiv (All)
open access
Constant-Loss Round-Preserving Direct Sums for Information Complexity
Strong direct-sum theorems relate the information needed to solve many independent instances of a communication problem to the information needed for one instance. For Gap-Majority composition, an optimal information bound was previously known, but preserving the number of communication rounds incur
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
- The optimal information complexity of VC learning#1247527
- Secret Sharing from Non-Extractable Randomness#1355106
- Secret Sharing from Non-Extractable Randomness#1335917
- Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem#1342543
- Further Remarks on Separating Words#818962
Record · ID 1326627
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