Skip to search formSkip to main contentSkip to account menu

Multiparty communication complexity

In the two–party communication game, introduced by , two players, P1 and P2 attempt to compute a Boolean function Player P1 knows the value of x2, P2… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
The present study is a first investigation on the potential influence of conversation and task involvement on quality ratings in… 
2017
2017
Secure multiparty computation is becoming a necessary component in many real-world systems. The efficiency of secure two-party… 
2016
2016
This project examines the effects of a president’s coalition management decisions on associated governing costs in a multiparty… 
2016
2016
Party A<sub>i</sub> of k parties A<sub>1</sub>,...,A<sub>k</sub> receives on its forehead a t-tuple (a<sub>i1</sub>,...,a<sub>it… 
Review
2015
Review
2015
In the United States, First Amendment protections for free speech are deeply associated with democracy. The dominant view in the… 
Review
2011
Review
2011
This essay examines whether developing countries with competitive multiparty democracies may be just as capable of sustaining… 
2010
2010
Communication complexity is an area of complexity theory that studies an abstract model of computation called a communication… 
2006
2006
Multiparty communication complexity is a measure of the amount of communication required to compute a function whose input is… 
Review
1996
Review
1996
The preceding chapter by Schofield develops the concept of the heart for general committee games when preferences are Euclidean…