222 search results - page 10 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
ASIACRYPT
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
JACM
2006
13 years 7 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...