A three-party communication problem

被引：0

作者：

Schulman, LJ ^{[1
]}

机构：

[1] Georgia Inst Technol, Coll Comp, Atlanta, GA 30332 USA

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1998年 / 57卷 / 03期

关键词：

D O I：

10.1006/jcss.1998.1603

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We show an Omega(log log n) lower bound on the deterministic communication complexity of the following problem. Three parties A, B, C are given inputs x, y, z epsilon (Z/2)(n), respectively, subject to the constraint x + y + z = 1(n). The function to be computed is f(x, y, z) = boolean ORi(x(i) boolean AND y(i) boolean AND z(j)). (C) 1998 Academic Press.

引用

页码：399 / 401

页数：3