Skip to main content
Avi Wigderson
Personal
CV
Short Bio
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness
Submitted by
smcneil
on Fri, 2013-03-08 16:41
Author:
P. Beame
T. Pitassi
N. Segerlind
A. Wigderson
Publication:
Proceedings of IEEE Conference on Computational Complexity, pp. 52-66, 2005.
Year:
2005
Files
File:
Proceedings Version (pdf)
‹ A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
up
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling ›