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]

Authors

Rahul Jain 0001

This author has not been identified. Look up 'Rahul Jain 0001' in Google

Attila Pereszlényi

This author has not been identified. Look up 'Attila Pereszlényi' in Google

Penghui Yao

This author has not been identified. Look up 'Penghui Yao' in Google