Skip to main content
Avi Wigderson
Personal
Short Bio
CV
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 Strong Direct Product Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
P. Beame
T. Pitassi
N. Segerlind
A. Wigderson
Publication:
CCC 2005, pp. 52-66, 2005.
Computational Complexity, vol. 15, no. 4, pp. 391-432, 2006.
Year:
2006
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/dsum.pdf
Hide
Files
File:
Draft of final version (pdf)
Draft of final version (ps)
bibTeX
‹ A Search Problem Related to Branch-and-Bound Procedures
up
Applications of the Sum-Product Theorem in Finite Fields ›