Abstract
Does the information complexity of a function equal its communication complexity? We examine whether any currently known techniques might be used to show a separation between the two notions. Ganor et al. recently provided such a separation in the distributional case for a specific input distribution. We show that in the non-distributional setting, the relative discrepancy bound is smaller than the information complexity, hence it cannot separate information and communication complexity. In addition, in the distributional case, we provide a linear program formulation for relative discrepancy and relate it to variants of the partition bound, resolving also an open question regarding the relation of the partition bound and information complexity. Last, we prove the equivalence between the adaptive relative discrepancy and the public-coin partition, implying that the logarithm of the adaptive relative discrepancy bound is quadratically tight with respect to communication.
Keywords
- Boolean Function
- Relative Discrepancy
- Communication Complexity
- Information Complexity
- Linear Program Formulation
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Braverman, M., Rao, A.: Information equals amortized communication. IEEE Transactions on Information Theory 60(10), 6058–6069 (2014)
Fano, R.M.: The transmission of information, Technical Report 65, Research Laboratory for Electronics. MIT, Cambridge (1949)
Jain, R., Radhakrishnan, J., Sen, P.: A direct sum theorem in communicationcomplexity 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)
Shannon, C.E.: A Mathematical Theory of Computation. The Bell System Technical Journal 27, 379–423, 623–656 (1948)
Chakrabarti, A., Wirth, A., Yao, A., Shi, Y.: Informational complexity and the direct sum problem for simultaneous message complexity. In: FOCS, pp. 270–278 (2001)
Jain, R., Radhakrishnan, J., Sen, P.: Optimal direct sum and privacy trade-off results for quantum and classical communication complexity. In: CoRR, vol. abs/0807.1267, pp. 285–296 (2008)
Harsha, P., Jain, R., McAllester, D., Radhakrishnan, J.: The communication complexity of correlation. In: CCC, pp. 10–23 (2007)
Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences 68(4), 702–732 (2004)
Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: STOC, pp. 67–76 (2010)
Braverman, M.: Interactive information complexity. In: STOC, pp. 505–524 (2012)
Yao, A.C.-C.: Lower bounds by probabilistic arguments. In: FOCS, pp. 420–428 (1983)
Yao, A.C.C.: Some complexity questions related to distributive computing (preliminary report). In: STOC, pp. 209–213 (1979)
Ganor, A., Kol, G., Raz, R.: Exponential separation of information and communication. In: ECCC, vol. 21, p. 49 (2014)
Ganor, A., Kol, G., Raz, R.: Exponential separation of information and communication for boolean functions. In: ECCC, vol. 113 (2014)
Kerenidis, I., Laplante, S., Lerays, V., Roland, J., Xiao, D.: Lower bounds on information complexity via zero-communication protocols and applications. In: FOCS, pp. 500–509 (2012)
Jain, R., Klauck, H.: The partition bound for classical communication complexity and query complexity. In: CCC, pp. 1–28 (2010)
Jain, R., Lee, T., Vishnoi, N.: A quadratically tight partition bound for classical communication complexity and query complexity. In: CoRR, vol. abs/1401.4512 (2014)
Gavinsky, D., Lovett, S.: En route to the log-rank conjecture: new reductions and equivalent formulations. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 514–524. Springer, Heidelberg (2014)
Fontes, L., Jain, R., Kerenidis, I., Laplante, S., Lauriere, M., Roland, J.: Relative Discrepancy does not separate Information and Communication Complexity (2015). http://eccc.hpi-web.de/report/2015/028/
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fontes, L., Jain, R., Kerenidis, I., Laplante, S., Laurière, M., Roland, J. (2015). Relative Discrepancy Does not Separate Information and Communication Complexity. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-662-47672-7_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47671-0
Online ISBN: 978-3-662-47672-7
eBook Packages: Computer ScienceComputer Science (R0)