A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity
Crossref DOI link: https://doi.org/10.1007/s00453-015-0100-0
Published Online: 2015-12-18
Published Print: 2016-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Jain, Rahul
Pereszlényi, Attila
Yao, Penghui
Text and Data Mining valid from 2015-12-18