133 search results - page 26 / 27 » Lower Bounds on the Randomized Communication Complexity of R... |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
JOC
2007
13 years 7 months ago
2007
This paper is about the Oblivious Transfer in the distributed model proposed by M. Naor and B. Pinkas. In this setting a Sender has n secrets and a Receiver is interested in one o...
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...
STOC
2010
ACM
14 years 9 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...