A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness

Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson. A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA. pages 52-66, IEEE Computer Society, 2005. [doi]

Abstract

Abstract is missing.