A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity

Rahul Jain 0001, Attila Pereszlényi, Penghui Yao. A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity. Algorithmica, 76(3):720-748, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.