We show an Ω(log n) lower bound on the deterministic com- munication complexity of the following problem. Three parties A. B, C are given inputs x, y, z ∈ (Z/2)~n, respectively, subject to the constraint x+y+z=1~n. The function to be computed is f (x,y,z)=V_I(x_I∧ Y_I∧z_I).
展开▼
机译:我们显示出以下问题的确定性通信复杂度的Ω(log n)下界。在约束x + y + z = 1〜n的情况下,分别向三方A,B,C提供输入x,y,z∈(Z / 2)〜n。要计算的函数为f(x,y,z)= V_I(x_I∧Y_I∧z_I)。
展开▼