Document Open Access Logo

Separation of the Factorization Norm and Randomized Communication Complexity

Authors Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley

PDF
Thumbnail PDF

File

LIPIcs.CCC.2023.1.pdf
  • Filesize: 0.77 MB
  • 16 pages

Document Identifiers

Author Details

Tsun-Ming Cheung
  • School of Computer Science, McGill University, Montreal, Canada
Hamed Hatami
  • School of Computer Science, McGill University, Montreal, Canada
Kaave Hosseini
  • Department of Computer Science, University of Rochester, NY, USA
Morgan Shirley
  • Department of Computer Science, University of Toronto, Canada

Funding

  • Hatami, Hamed: Supported by an NSERC grant.
  • Shirley, Morgan: Supported by an NSERC grant.

Cite AsGet BibTex

Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, and Morgan Shirley. Separation of the Factorization Norm and Randomized Communication Complexity. In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 1:1-1:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.CCC.2023.1

Abstract

In an influential paper, Linial and Shraibman (STOC '07) introduced the factorization norm as a powerful tool for proving lower bounds against randomized and quantum communication complexities. They showed that the logarithm of the approximate γ₂-factorization norm is a lower bound for these parameters and asked whether a stronger lower bound that replaces approximate γ₂ norm with the γ₂ norm holds. We answer the question of Linial and Shraibman in the negative by exhibiting a 2ⁿ×2ⁿ Boolean matrix with γ₂ norm 2^Ω(n) and randomized communication complexity O(log n). As a corollary, we recover the recent result of Chattopadhyay, Lovett, and Vinyals (CCC '19) that deterministic protocols with access to an Equality oracle are exponentially weaker than (one-sided error) randomized protocols. In fact, as a stronger consequence, our result implies an exponential separation between the power of unambiguous nondeterministic protocols with access to Equality oracle and (one-sided error) randomized protocols, which answers a question of Pitassi, Shirley, and Shraibman (ITSC '23). Our result also implies a conjecture of Sherif (Ph.D. thesis) that the γ₂ norm of the Integer Inner Product function (IIP) in dimension 3 or higher is exponential in its input size.

Subject Classification

ACM Subject Classification
  • Theory of computation → Communication complexity
Keywords
  • Factorization norms
  • randomized communication complexity

Metrics

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

References

  1. Shalev Ben-David, Adam Bouland, Ankit Garg, and Robin Kothari. Classical lower bounds from quantum upper bounds. 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 339-349, 2018. Google Scholar
  2. Arkadev Chattopadhyay, Shachar Lovett, and Marc Vinyals. Equality alone does not simulate randomness. In 34th Computational Complexity Conference (CCC 2019), 2019. Google Scholar
  3. Alexander Edmonds, Aleksandar Nikolov, and Jonathan Ullman. The power of factorization mechanisms in local and central differential privacy. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 425-438, New York, NY, USA, June 2020. Association for Computing Machinery. Google Scholar
  4. Ben Green and Tom Sanders. Boolean functions with small spectral norm. Geometric and Functional Analysis, 18(1):144-162, 2008. Google Scholar
  5. Lianna Hambardzumyan, Hamed Hatami, and Pooya Hatami. Dimension-free bounds and structural results in communication complexity. Israel J. Math., 2022. URL: https://doi.org/10.1007/s11856-022-2365-8.
  6. Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, and Rosie Zhao. Lower bound methods for sign-rank and their limitations. In Approximation, Randomization, and Combinatorial Optimization. Algorithms a, volume 245, pages 22:1-22:24, 2022. Google Scholar
  7. Monika Henzinger and Jalaj Upadhyay. Constant matters: Fine-grained complexity of differentially private continual observation using completely bounded norms. arXiv preprint, 2022. URL: https://arxiv.org/abs/2202.11205.
  8. Wei Huang, Yaoyun Shi, Shengyu Zhang, and Yufan Zhu. The communication complexity of the Hamming distance problem. Inform. Process. Lett., 99(4):149-153, 2006. Google Scholar
  9. Hartmut Klauck. Lower bounds for quantum communication complexity. In Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pages 288-297. IEEE, 2001. Google Scholar
  10. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, Cambridge, 1997. Google Scholar
  11. Troy Lee, Adi Shraibman, and Robert Špalek. A direct product theorem for discrepancy. In 2008 23rd Annual IEEE Conference on Computational Complexity, pages 71-80, 2008. URL: https://doi.org/10.1109/CCC.2008.25.
  12. Nati Linial and Adi Shraibman. Lower bounds in communication complexity based on factorization norms. Random Structures & Algorithms, 34(3):368-394, 2009. Google Scholar
  13. Jiri Matousek, Aleksandar Nikolov, and Kunal Talwar. Factorization norms and hereditary discrepancy. arXiv preprint, 2014. URL: https://arxiv.org/abs/1408.1376.
  14. Shanmugavelayutham Muthukrishnan and Aleksandar Nikolov. Optimal private halfspace counting via discrepancy. In Proceedings of the forty-fourth annual ACM symposium on Theory of computing, pages 1285-1292, 2012. Google Scholar
  15. Ramamohan Paturi and Janos Simon. Probabilistic communication complexity. Journal of Computer and System Sciences, 33(1):106-123, 1986. Google Scholar
  16. Toniann Pitassi, Morgan Shirley, and Adi Shraibman. The strength of equality oracles in communication. In Yael Tauman Kalai, editor, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), volume 251 of Leibniz International Proceedings in Informatics (LIPIcs), pages 89:1-89:19, Dagstuhl, Germany, 2023. Schloss Dagstuhl endash Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ITCS.2023.89.
  17. Alexander A Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67(1):145, 2003. Google Scholar
  18. Suhail Sherif. Communication Complexity and Quantum Optimization Lower Bounds via Query Complexity. PhD thesis, Tata Institute of Fundamental Research, Mumbai, 2021. Google Scholar
  19. József Solymosi. Incidences and the spectra of graphs. In Combinatorial number theory and additive group theory, pages 299-314. Springer, 2009. 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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact