A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Simultaneous Multiparty Communication Complexity of Composed Functions
[article]

2017
*
arXiv
*
pre-print

In the Number On the Forehead (NOF) multiparty communication model, k players want to evaluate a function F : X_1 ×...× X_k→ Y on some input (x_1,...,x_k) by broadcasting bits according to a predetermined protocol. The input is distributed in such a way that each player i sees all of it except x_i. In the simultaneous setting, the players cannot speak to each other but instead send information to a referee. The referee does not know the players' input, and cannot give any information back. At

arXiv:1710.01969v1
fatcat:jjxa7xzkhrfejgayg6yyh6iq2m