Note
A Three-Party Communication Problem

https://doi.org/10.1006/jcss.1998.1603Get rights and content
Under an Elsevier user license
open archive

Abstract

We show anΩ(log log n) lower bound on the deterministic communication complexity of the following problem. Three partiesA,B,Care given inputsx,y,z∈(Z/2)n, respectively, subject to the constraintx+y+z=1n. The function to be computed isf(x, y, z)=∨i(xiyizi).

Cited by (0)

B. H. Korte