The Bns lower-bound for multiparty protocols is nearly optimal

Abstract

We present a multi-party protocol which computes the Generalized Inner Product (GIP) function, introduced by Babai et al. (1989, in "Proceedings, 21st ACM STOC," pp. 1-11). Our protocol shows that the lower bound for the multi-party communication complexity of the GIP function, given by Babai et al., cannot be improved significantly. © 1994 Academic Press, Inc.