A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness.
In: CCC; (2005) S. 52-66
Konferenz
Zugriff:
Titel: |
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness.
|
---|---|
Autor/in / Beteiligte Person: | Beame, Paul ; Pitassi, Toniann ; Segerlind, Nathan ; Wigderson, Avi |
Link: | |
Quelle: | CCC; (2005) S. 52-66 |
Veröffentlichung: | 2005 |
Medientyp: | Konferenz |
DOI: | 10.1109/CCC.2005.1 |
Sonstiges: |
|