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

  • Paul Beame*
  • , Toniann Pitassi
  • , Nathan Segerlind
  • , Avi Wigderson
  • *Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations

Fingerprint

Dive into the research topics of 'A direct sum theorem for corruption and the multiparty nof communication complexity of set disjointness'. Together they form a unique fingerprint.

Keyphrases

Computer Science