Document Open Access Logo

A Candidate for a Strong Separation of Information and Communication

Authors Mark Braverman, Anat Ganor, Gillat Kol, Ran Raz



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2018.11.pdf
  • Filesize: 472 kB
  • 13 pages

Document Identifiers

Author Details

Mark Braverman
Anat Ganor
Gillat Kol
Ran Raz

Cite AsGet BibTex

Mark Braverman, Anat Ganor, Gillat Kol, and Ran Raz. A Candidate for a Strong Separation of Information and Communication. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 11:1-11:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ITCS.2018.11

Abstract

The weak interactive compression conjecture asserts that any two-party communication protocol with communication complexity C and information complexity I can be compressed to a protocol with communication complexity poly(I)polylog(C). We describe a communication problem that is a candidate for refuting that conjecture. Specifically, while we show that the problem can be solved by a protocol with communication complexity C and information complexity I=polylog(C), the problem seems to be hard for protocols with communication complexity poly(I)polylog(C)=polylog(C).
Keywords
  • communication complexity
  • amortized communication complexity
  • communication compression
  • direct sum
  • information complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68(4):702-732, 2004. Google Scholar
  2. Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. How to compress interactive communication. In STOC, pages 67-76, 2010. Google Scholar
  3. Mark Braverman. Interactive information complexity. In STOC, pages 505-524, 2012. Google Scholar
  4. Mark Braverman. A hard-to-compress interactive task? In 51th Annual Allerton Conference on Communication, Control, and Computing, 2013. Google Scholar
  5. Mark Braverman and Anup Rao. Information equals amortized communication. In FOCS, pages 748-757, 2011. Google Scholar
  6. Mark Braverman and Omri Weinstein. A discrepancy lower bound for information complexity. In APPROX-RANDOM, pages 459-470, 2012. Google Scholar
  7. Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, and Andrew Chi-Chih Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In FOCS, pages 270-278, 2001. Google Scholar
  8. Anat Ganor, Gillat Kol, and Ran Raz. Exponential separation of information and communication. In FOCS, 2014. Google Scholar
  9. Anat Ganor, Gillat Kol, and Ran Raz. Exponential separation of communication and external information. In STOC, pages 977-986, 2016. Google Scholar
  10. Anat Ganor, Gillat Kol, and Ran Raz. Exponential separation of information and communication for boolean functions. Journal of the ACM, 63(5):46:1-46:31, 2016. Google Scholar
  11. Amiram H. Kaspi. Two-way source coding with a fidelity criterion. IEEE Transactions on Information Theory, 31(6):735-740, 1985. Google Scholar
  12. Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, and David Xiao. Lower bounds on information complexity via zero-communication protocols and applications. In FOCS, pages 500-509, 2012. Google Scholar
  13. Gillat Kol. Interactive compression for product distributions. In STOC, pages 987-998, 2016. Google Scholar
  14. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, 1997. Google Scholar
  15. Troy Lee and Adi Shraibman. Lower bounds in communication complexity. Foundations and Trends in Theoretical Computer Science, 3(4):263-398, 2009. Google Scholar
  16. Alon Orlitsky and James R. Roche. Coding for computing. IEEE Transactions on Information Theory, 47(3):903-917, 2001 (Preliminary version at the IEEE International Symposium on Information Theory (ISIT) 1995, FOCS 1995). Google Scholar
  17. Anup Rao and Makrand Sinha. Simplified separation of information and communication. Electronic Colloquium on Computational Complexity (ECCC), 2015. Google Scholar
  18. Alexander A. Sherstov. Compressing interactive communication under product distributions. In FOCS, pages 535-544, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail