50 citations · 73 across the 11 of their papers we have counts for
1 paper · 1 filter
Iordanis Kerenidis, Ran Raz
We give a tight lower bound of Omega(\sqrt{n}) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way…