Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Computer and System Sciences

A linear lower bound on the unbounded error probabilistic communication complexity

Jürgen Forster

Published Dec 1, 2002• 189 citations
Publisher
DOI
10.1016/s0022-0000(02)00019-3

Related papers

Lower bounds for one-way probabilistic communication complexity

Farid Mansurovich Ablayev

Lecture notes in computer science•Jan 1, 1993•16 citations

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval

Iftach Haitner, Jonathan J. Hoch, Gil Segev

Springer eBooks•Feb 25, 2008•12 citations

A linear lower bound on the unbounded error probabilistic communication complexity

Jüurgen Forster

We prove a general lower bound on the complexity of unbounded error probabilistic communication protocols. This result improves on a lower bound for bounded error protocols from Krause (1996). As a simple consequence we get the, to our knowledge, first linear lower bound on the complexity of unbounded error probabilistic communication protocols for the functions defined by Hadamard matrices. We also give an upper bound on the margin of any embedding of a concept class in half spaces.

IEEE Conference on Computational Complexity (CCC)•Nov 13, 2002•15 citations

Fourier analysis for probabilistic communication complexity

Ran Raz

Computational Complexity•Sep 1, 1995•46 citations

A note on a problem in communication complexity

Henning Wunderlich

We study bounded-error randomization and majority operators in structural communication complexity. We give a communication-complexity formulation of Tarui's theorem and identify the bounded-error closure of weakly unbounded-error communication with a distributional perturbation of logarithmic margin complexity. Retaining the Boolean guarantee in Tarui's probabilistic polynomials yields the stronger inclusion $\mathsf{PH}^{\mathrm{cc}} \subseteq \mathsf{ZP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \subseteq \mathsf{BP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$. We also define a majority operator satisfying $\mathsf{PP}\mathbin{\cdot} \mathsf{P}^{\mathrm{cc}} = \mathsf{PP}^{\mathrm{cc}}$ and use Sasaki's majority formula to prove that $\mathord{\oplus}\mathsf{P}^{\mathrm{cc}} \subseteq \mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}$. For the inner-product function modulo two, both the outer index and each inner protocol have logarithmic cost. Together with Forster's lower bound, this gives an explicit witness to the non-idempotence of the majority operator and to $\mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \not\subseteq \mathsf{UPP}^{\mathrm{cc}}$. Both the bounded-error closure and the two-level majority class are contained in $\mathsf{PSPACE}^{\mathrm{cc}}$.

arXiv:1205.0903•May 4, 2012•2 citations

The Unbounded-Error Communication Complexity of Symmetric Functions

Alexander A. Sherstov

We prove an essentially tight lower bound on the unbounded-error communication complexity of every symmetric function, i.e., f(x,y)=D(|x∧y|), where D: {0,1,…,n}→{0,1} is a given predicate and x,y range over {0,1} n . Specifically, we show that the communication complexity of f is between Θ(k/log5 n) and Θ(k logn), where k is the number of value changes of D in {0,1,…, n}. Prior to this work, the problem was solved only for the parity predicate D (Forster 2001). Our proof is built around two new ideas. First, we show that a predicate D gives rise to a rapidly mixing random walk on ℤ 2 , which allows us to reduce the problem to communication lower bounds for “typical” predicates. Second, we use Paturi’s approximation lower bounds (1992), suitably generalized here to clusters of real nodes in [0,n] and interpreted in their dual form, to prove that a typical predicate behaves analogous to the parity predicate with respect to a smooth distribution on the inputs.

COMBINATORICA•Oct 1, 2008•38 citations
We study bounded-error randomization and majority operators in structural communication complexity. We give a communication-complexity formulation of Tarui's theorem and identify the bounded-error closure of weakly unbounded-error communication with a distributional perturbation of logarithmic margin complexity. Retaining the Boolean guarantee in Tarui's probabilistic polynomials yields the stronger inclusion PHcc⊆ZP⋅PPcc⊆BP⋅PPcc\mathsf{PH}^{\mathrm{cc}} \subseteq \mathsf{ZP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \subseteq \mathsf{BP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}PHcc⊆ZP⋅PPcc⊆BP⋅PPcc. We also define a majority operator satisfying PP⋅Pcc=PPcc\mathsf{PP}\mathbin{\cdot} \mathsf{P}^{\mathrm{cc}} = \mathsf{PP}^{\mathrm{cc}}PP⋅Pcc=PPcc and use Sasaki's majority formula to prove that ⊕Pcc⊆PP⋅PPcc\mathord{\oplus}\mathsf{P}^{\mathrm{cc}} \subseteq \mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}}⊕Pcc⊆PP⋅PPcc. For the inner-product function modulo two, both the outer index and each inner protocol have logarithmic cost. Together with Forster's lower bound, this gives an explicit witness to the non-idempotence of the majority operator and to PP⋅PPcc⊈UPPcc\mathsf{PP}\mathbin{\cdot} \mathsf{PP}^{\mathrm{cc}} \not\subseteq \mathsf{UPP}^{\mathrm{cc}}PP⋅PPcc⊆UPPcc. Both the bounded-error closure and the two-level majority class are contained in PSPACEcc\mathsf{PSPACE}^{\mathrm{cc}}PSPACEcc.
We prove an essentially tight lower bound on the unbounded-error communication complexity of every symmetric function, i.e., f(x,y)=D(|x∧y|), where D: {0,1,…,n}→{0,1} is a given predicate and x,y range over {0,1} n . Specifically, we show that the communication complexity of f is between Θ(k/log5 n) and Θ(k logn), where k is the number of value changes of D in {0,1,…, n}. Prior to this work, the problem was solved only for the parity predicate D (Forster 2001). Our proof is built around two new ideas. First, we show that a predicate D gives rise to a rapidly mixing random walk on ℤ 2 , which allows us to reduce the problem to communication lower bounds for “typical” predicates. Second, we use Paturi’s approximation lower bounds (1992), suitably generalized here to clusters of real nodes in [0,n] and interpreted in their dual form, to prove that a typical predicate behaves analogous to the parity predicate with respect to a smooth distribution on the inputs.