Multiparty communication complexity
id:
multiparty-communication-complexity-314-12419300
title:
Multiparty communication complexity
text:
In theoretical computer science, multiparty communication complexity is the study of communication complexity in the setting where there are more than 2 players. In the traditional two–party communication game, introduced by Yao (1979), two players, P1 and P2 attempt to compute a Boolean function Player P1 knows the value of x2, P2 knows the value of x1, but Pi does not know the value of xi, for i = 1, 2. In other words, the players know the other's variables, but not their own. The minimum numb
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Multiparty_communication_complexity
date created:
date modified:
2023-08-17T22:01:40Z
main entity:
{"identifier":"Q6934835","url":"https://www.wikidata.org/entity/Q6934835"}
image:
fields total:
13
integrity:
13