50 search results - page 1 / 10 » Languages with Bounded Multiparty Communication Complexity |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...