2026-08-13T19:55:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1776 2024-03-06T11:08:19Z ddc:004 open_access

Approximation norms and duality for communication complexity lower bounds Lee, Troy Shraibman, Adi Communication complexity lower bounds Abstract: We will discuss a general norm based framework for showing lower bounds on communication complexity. An advantage of this approach is that one can use duality theory to obtain a lower bound quantity phrased as a maximization problem, which can be more convenient to work with in showing lower bounds. We discuss two applications of this approach. 1. The approximation rank of a matrix A is the minimum rank of a matrix close to A in ell_infty norm. The logarithm of approximation rank lower bounds quantum communication complexity and is one of the most powerful techniques available, albeit difficult to compute in practice. We show that an approximation norm known as gamma_2 is polynomially related to approximation rank. This results in a polynomial time algorithm to approximate approximation rank, and also shows that the logarithm of approximation rank lower bounds quantum communication complexity even with entanglement which was previously not known. 2. By means of an approximation norm which lower bounds multiparty number-on-the-forehead complexity, we show non-trivial lower bounds on the complexity of the disjointness function for up to c log log n players, c <1. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Troy Lee and Adi Shraibman 2008 Is Part Of Dagstuhl Seminar Proceedings, Volume 8381, Computational Complexity of Discrete Problems (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.08381.3 urn:nbn:de:0030-drops-17768 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08381.3 eng https://creativecommons.org/licenses/by/4.0/legalcode