|
|||||
|
|
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness |
|
| Authors: | Paul Beame Toniann Pitassi Nathan Segerlind Avi Wigderson |
| Affiliation: | (1) Computer Science & Engineering, University of Washington, Seattle, WA 98195-2350, USA;(2) Department of Computer Science, University of Toronto, Toronto, ON, M5S 1A4, Canada;(3) Department of Computer Science, Portland State University, Portland, OR 97207-0751, USA;(4) School of Mathematics, Institute for Advanced Study, Princeton, NJ 05840, USA |
| Abstract: | |
| Keywords: | Communication complexity direct product direct sum multiparty protocols lower bounds |
| 本文献已被 SpringerLink 等数据库收录！ | |