Abstract
We prove that several measures in communication complexity are equivalent, up to polynomial factors in the logarithm of the rank of the associated matrix: deterministic communication complexity, randomized communication complexity, information cost and zero-communication cost. This shows that in order to prove the log-rank conjecture, it suffices to show that low-rank matrices have efficient protocols in any of the aforementioned measures.
Furthermore, we show that the notion of zero-communication complexity is equivalent to an extension of the common discrepancy bound. Linial et al. [Combinatorica, 2007] showed that the discrepancy of a sign matrix is lower-bounded by an inverse polynomial in the logarithm of the associated matrix. We show that if these results can be generalized to the extended discrepancy, this will imply the log-rank conjecture.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ben-Sasson, E., Lovett, S., Ron-Zewi, N.: An Additive Combinatorics Approach Relating Rank to Communication Complexity. In: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science, pp. 177–186 (2012)
Jain, R., Klauck, H.: The Partition Bound for Classical Communication Complexity and Query Complexity. In: Proceedings of the 25th IEEE Conference on Computational Complexity, pp. 247–258 (2010)
Kerenidis, I., Laplante, S., Lerays, V., Roland, J., Xiao, D.: Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. In: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science, pp. 500–509 (2012)
Kotlov, A.: Rank and Chromatic Number of a Graph. Journal of Graph Theory 26(1), 1–8 (1997)
Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)
Linial, N., Mendelson, S., Schechtman, G., Schraibman, A.: Complexity Measures of Sign Matrices. Combinatorica 27(4), 439–463 (2007)
Linial, N., Schraibman, A.: Learning Complexity vs. Communication Complexity. Combinatorics, Probability & Computing 18(1-2), 227–245 (2009)
Lovász, L., Saks, M.: Lattices, Möbius Functions and Communication Complexity. In: Annual Symposium on Foundations of Computer Science, pp. 81–90 (1988)
Lovett, S.: Communication is Bounded by Root of Rank. In: Proceedings of the 46th Symposium on Theory of Computing (2014)
Nisan, N., Wigderson, A.: On Rank vs. Communication Complexity. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 831–836 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavinsky, D., Lovett, S. (2014). En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43948-7_43
Download citation
DOI: https://doi.org/10.1007/978-3-662-43948-7_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43947-0
Online ISBN: 978-3-662-43948-7
eBook Packages: Computer ScienceComputer Science (R0)