arXiv (All)
open access
A note on the partition bound for one-way classical communication complexity
We present a linear program for a one-way version of the partition bound of Jain and Klauck, denoted $\mathsf{prt}^1_\varepsilon(f)$, and show that it characterizes the one-way randomized communication complexity $\mathsf{R}_\varepsilon^1(f)$ with shared randomness and worst-case error $\varepsilon$
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
- Almost Optimal FPT Inapproximability for k-SetCover#1014273
- Channels with Markov Synchronization Errors: Information Stability and Capacity Bounds#139065
- Security Considerations for Signaling Transport (SIGTRAN) Protocols#141981
- Bounded Rationality, Indeterminacy, and the Theory of the Firm#941655
- Almost sure upper bound for sums of random multiplicative functions and critical chaos#1063992
Record · ID 974136
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