A note on the partition bound for one-way classical communication complexity

Srinivasan Arunachalam; Joao F. Doriguello; Rahul Jain

Home/Archive/arXiv

arXiv · 2302.10431

A note on the partition bound for one-way classical communication complexity

Srinivasan Arunachalam·Joao F. Doriguello·Rahul Jain

View original source ↗Read source document ↗Export metadata ↓

Abstract

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$ of any relation $f\subseteq\mathcal{X}\times\mathcal{Y}\times\mathcal{Z}$. More precisely, for all $\varepsilon,\delta\in(0,1/2)$, $\mathsf{R}_\varepsilon^1(f) \geq \log\mathsf{prt}_\varepsilon^1(f)$ and $\mathsf{R}_{\varepsilon+\delta}^1(f) \leq \lceil\log\mathsf{prt}_\varepsilon^1(f) + \log\log(1/\delta)\rceil$. This improves upon the characterization of $\mathsf{R}_\varepsilon^1(f)$ in terms of the rectangle bound due to Jain, Klauck, and Nayak [STOC'08], which is tight only up to an additive $O(\log(1/\delta))$ term.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Srinivasan Arunachalam, Joao F. Doriguello, Rahul Jain. 2023-02-21. A note on the partition bound for one-way classical communication complexity. https://arxiv.org/abs/2302.10431

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.CC subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗