The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
A Strong Direct Product Theorem for Disjointness
[article]
2010
arXiv
pre-print
A strong direct product theorem states that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then the overall success probability will be exponentially small in k. We establish such a theorem for the randomized communication complexity of the Disjointness problem, i.e., with communication const· kn the success probability of solving k instances of size n can only be exponentially small in k. We show that this bound even
arXiv:0908.2940v3
fatcat:peg2x6wjjffgfcuswgihxyvlsu