License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-17768
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1776/
Go to the corresponding Portal


Lee, Troy ; Shraibman, Adi

Approximation norms and duality for communication complexity lower bounds

pdf-format:
Document 1.pdf (174 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{lee_et_al:DSP:2008:1776,
  author =	{Troy Lee and Adi Shraibman},
  title =	{Approximation norms and duality for communication complexity lower bounds},
  booktitle =	{Computational Complexity of Discrete Problems },
  year =	{2008},
  editor =	{Peter Bro Miltersen and R{\"u}diger Reischuk and Georg Schnitger and Dieter van Melkebeek},
  number =	{08381},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1776},
  annote =	{Keywords: Communication complexity, lower bounds}
}

Keywords: Communication complexity, lower bounds
Seminar: 08381 - Computational Complexity of Discrete Problems
Issue Date: 2008
Date of publication: 11.12.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI