Advertisement

Abstract

For a variety of reasons, a number of recent works have studied the classic communication problem index, and its variant augmented-index, from a tradeoff perspective: how much communication can Alice (the player holding the n data bits) save if Bob (the player holding the index) communicates a nontrivial amount? Recently, Magniez et al. (STOC, 2010), Chakrabarti et al. (FOCS, 2010) and Jain and Nayak gave information cost tradeoffs for this problem, where the amount of communication is measured as the amount of information revealed by one player to the other. The latter two works showed that reducing Alice’s communication to sublinear requires at least a constant amount of communication from Bob.

Here, we show that the above result is just one point on a more general tradeoff curve. That is, we extend the earlier result to show that, for all b, either Bob reveals Ω(b) information to Alice, or else Alice reveals n/2 O(b) information to Bob. This tradeoff lower bound is easily seen to be everywhere-tight, by virtue of an easy two-round deterministic protocol. Our lower bound applies to constant-error randomized protocols, with information measured under an “easy” distribution on inputs.

Keywords

Augmented Index Index Problem Frequency Moment Streaming Model Data Stream Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 175(2), 139–159 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bar-Yossef, Z., Jayram, T.S., Krauthgamer, R., Kumar, R.: The sketching complexity of pattern matching. In: Proc. 8th International Workshop on Randomization and Approximation Techniques in Computer Science, pp. 261–272 (2004)Google Scholar
  3. 3.
    Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci. 68(4), 702–732 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Chakrabarti, A., Cormode, G., Kondapally, R., McGregor, A.: Information cost tradeoffs for augmented index and streaming language recognition. In: Proc. 51st Annual IEEE Symposium on Foundations of Computer Science, pp. 387–396 (2010)Google Scholar
  5. 5.
    Chakrabarti, A., Khot, S., Sun, X.: Near-optimal lower bounds on the multi-party communication complexity of set disjointness. In: Proc. 18th Annual IEEE Conference on Computational Complexity, pp. 107–117 (2003)Google Scholar
  6. 6.
    Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.C.: Informational complexity and the direct sum problem for simultaneous message complexity. In: Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 270–278 (2001)Google Scholar
  7. 7.
    Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: Proc. 41st Annual ACM Symposium on the Theory of Computing, pp. 205–214 (2009)Google Scholar
  8. 8.
    Do Ba, K., Indyk, P., Price, E., Woodruff, D.P.: Lower bounds for sparse recovery. In: Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1190–1197 (2010)Google Scholar
  9. 9.
    Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the data-stream model. SIAM J. Comput. 38(6), 1709–1727 (2008); Preliminary version in Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 745–754 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Gronemeier, A.: Asymptotically optimal lower bounds on the NIH-multi-party information complexity of the AND-function and disjointness. In: Proc. 26th International Symposium on Theoretical Aspects of Computer Science, pp. 505–516 (2009)Google Scholar
  11. 11.
    Jain, R., Nayak, A.: The space complexity of recognizing well-parenthesized expressions in the streaming model: the index function revisited. Technical Report Revision #1 to TR10-071, Electronic Colloquium on Computational Complexity (July 2010), http://eccc.hpi-web.de/
  12. 12.
    Jain, R., Radhakrishnan, J., Sen, P.: A property of quantum relative entropy with an application to privacy in quantum communication. J. ACM 56(6) (2009)Google Scholar
  13. 13.
    Jayram, T.S., Kumar, R., Sivakumar, D.: The one-way communication complexity of gap hamming distance. Theor. Comput. 4(1), 129–135 (2008)CrossRefzbMATHGoogle Scholar
  14. 14.
    Kane, D.M., Nelson, J., Woodruff, D.P.: On the exact space complexity of sketching and streaming small norms. In: Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1161–1178 (2010)Google Scholar
  15. 15.
    Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)Google Scholar
  16. 16.
    Magniez, F., Mathieu, C., Nayak, A.: Recognizing well-parenthesized expressions in the streaming model. In: Proc. 41st Annual ACM Symposium on the Theory of Computing, pp. 261–270 (2010)Google Scholar
  17. 17.
    Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57(1), 37–49 (1998); Preliminary version in Proc. 27th Annual ACM Symposium on the Theory of Computing, pp. 103–111 (1995)Google Scholar
  18. 18.
    Pǎtraşcu, M.: Unifying the landscape of cell-probe lower bounds. Manuscript (2010), http://people.csail.mit.edu/mip/papers/structures/paper.pdf
  19. 19.
    Pǎtraşcu, M., Viola, E.: Cell-probe lower bounds for succinct partial sums. In: Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 117–122 (2010)Google Scholar
  20. 20.
    Woodruff, D.P.: Optimal space lower bounds for all frequency moments. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 167–175 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Amit Chakrabarti
    • 1
  • Ranganath Kondapally
    • 1
  1. 1.Department of Computer ScienceDartmouth CollegeHanoverUSA

Personalised recommendations