222 search results - page 27 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
STOC
1991
ACM
13 years 10 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
MASCOTS
2007
13 years 8 months ago
2007
—1 End to end QoS of communication systems is essential for users but their performance evaluation is a complex issue. The ion of such systems are usually given by multidimension...
ECCC
2008
13 years 6 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
TIT
2010
13 years 1 months ago
2010
We consider a power-efficient communication model for wireless sensor networks where silence is used to convey information. We study the average-case and worstcase complexities of ...
EUROCRYPT
2003
Springer
13 years 12 months ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...