PubPeer
The online Journal club
login
create account
Home
Publications
Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems
ACM Transactions on Computation Theory (2015) -
Comments
doi: 10.1145/2698587 issn: 1942-3454 issn: 1942-3462
Andris Ambainis, William Gasarch, Aravind Srinivasan, Andrey Utis
Go to article
Go to preprint
Association for Computing Machinery (ACM)
Comments awaiting moderation ({{totalComments}})
Review last reports ({{totalReports}})
Review last email suggestions ({{totalPendingEmails}})
Last month's whitelisted comments ({{totalWhitelistedComments}})