24421 search results - page 53 / 4885 » Communicating Complex Systems |
COCO
2009
Springer
14 years 2 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...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
QCQC
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...
FOCS
1994
IEEE
13 years 12 months ago
1994
IEEE
This paper concerns the open problem of Lov