489 search results - page 7 / 98 » Communication Complexity of Permutation-Invariant Functions |
ICALP
2007
Springer
15 years 4 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...
JOT
2010
14 years 8 months ago
2010
Validation of non-functional and functional properties of these protocols during the early stages of design and development is important to reduce cost resulting from protocol ano...
100
click to vote
COCO
2001
Springer
15 years 2 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
114
click to vote
COCO
2009
Springer
15 years 5 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...