Advertisement

Abstract

We study two natural variations of the set disjointness problem, arguably the most central problem in communication complexity.

For the k-sparse set disjointness problem, where the parties each hold a k-element subset of an n-element universe, we show a tight Θ(k logk) bound on the randomized one-way communication complexity. In addition, we present a slightly simpler proof of an O(k) upper bound on the general randomized communication complexity of this problem, due originally to Håstad and Wigderson.

For the lopsided set disjointness problem, we obtain a simpler proof of Pătraşcu’s breakthrough result, based on the information cost method of Bar-Yossef et al. The information-theoretic proof is both significantly simpler and intuitive; this is the first time the direct sum methodology based on information cost has been successfully adapted to the asymmetric communication setting. Our result shows that when Alice has a elements and Bob has b elements (a ≪ b) from an n-element universe, in any randomized protocol for disjointness, either Alice must communicate Ω(a) bits or Bob must communicate Ω(b) bits.

Keywords

Random Mapping Communication Complexity Hellinger Distance Tight Lower Bound Parallel Repetition Theorem 
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.M.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. TCS 157(2), 139–159 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory (preliminary version). In: FOCS, pp. 337–347 (1986)Google Scholar
  3. 3.
    Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: Information theory methods in communication complexity. In: CCC, pp. 93–102 (2002)Google Scholar
  4. 4.
    Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. JCSS 68(4), 702–732 (2004)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: STOC, pp. 67–76 (2010)Google Scholar
  6. 6.
    Braverman, M., Rao, A.: Information equals amortized communication. In: FOCS, pp. 748–757 (2011)Google Scholar
  7. 7.
    Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.C.-C.: Informational complexity and the direct sum problem for simultaneous message complexity. In: FOCS, pp. 270–278 (2001)Google Scholar
  8. 8.
    Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Inc. (1991)Google Scholar
  9. 9.
    Harsha, P., Jain, R., McAllester, D.A., Radhakrishnan, J.: The communication complexity of correlation. TOIT 56(1), 438–449 (2010)MathSciNetGoogle Scholar
  10. 10.
    Håstad, J., Wigderson, A.: The randomized communication complexity of set disjointness. ToC 3(1), 211–219 (2007)CrossRefGoogle Scholar
  11. 11.
    Jain, R., Radhakrishnan, J., Sen, P.: A Direct Sum Theorem in Communication Complexity Via Message Compression. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 300–315. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Jayram, T.S.: Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 562–573. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  13. 13.
    Jayram, T.S., Kopparty, S., Raghavendra, P.: On the communication complexity of read-once AC0 formulae. In: CCC, pp. 329–340 (2009)Google Scholar
  14. 14.
    Jayram, T.S., Kumar, R., Sivakumar, D.: Two applications of information complexity. In: STOC, pp. 673–682 (2003)Google Scholar
  15. 15.
    Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIDMA 5(4), 545–557 (1992)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Kremer, I., Nisan, N., Ron, D.: On randomized one-round communication complexity. Computational Complexity 8(1), 21–49 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press (1997)Google Scholar
  18. 18.
    Pătraşcu, M.: Unifying the landscape of cell-probe lower bounds. SICOMP 40(3), 827–847 (2011)zbMATHGoogle Scholar
  19. 19.
    Raz, R.: A parallel repetition theorem. SICOMP 27(3), 763–803 (1998)MathSciNetzbMATHGoogle Scholar
  20. 20.
    Razborov, A.A.: On the distributional complexity of disjointness. TCS 106(2), 385–390 (1992)MathSciNetzbMATHCrossRefGoogle Scholar
  21. 21.
    Saks, M.E., Sun, X.: Space lower bounds for distance approximation in the data stream model. In: STOC, pp. 360–369 (2002)Google Scholar
  22. 22.
    Sen, P., Venkatesh, S.: Lower bounds for predecessor searching in the cell probe model. JCSS 74(3), 364–385 (2008)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Anirban Dasgupta
    • 1
  • Ravi Kumar
    • 1
  • D. Sivakumar
    • 1
  1. 1.Yahoo! ResearchSunnyvaleUSA

Personalised recommendations