A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness

A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness

We prove that corruption, one of the most powerful measures used to analyze 2-party randomized communication complexity, satisfies a strong direct sum property under rectangular distributions. This direct sum bound holds even when the error is allowed to be exponentially close to 1. We use this to a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Beame, P., Pitassi, T., Segerlind, N., Wigderson, A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Broadcasting
Complexity theory
Computational complexity
Forehead
Frequency
Protocols
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We prove that corruption, one of the most powerful measures used to analyze 2-party randomized communication complexity, satisfies a strong direct sum property under rectangular distributions. This direct sum bound holds even when the error is allowed to be exponentially close to 1. We use this to analyze the complexity of the widely-studied set disjointness problem in the usual "number-on-the-forehead" (NOF) model of multiparty communication complexity.
ISSN:1093-0159
2575-8403
DOI:10.1109/CCC.2005.1