16 search results - page 4 / 4 » Smooth Tradeoffs between Insert and Query Complexity in Near... |
COCO
2005
Springer
13 years 11 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...