13 citations · 25 across the 15 of their papers we have counts for
1 paper · 2 filters
Shalev Ben-David, Eric Blais
We establish two new direct product theorems for the randomized query complexity of Boolean functions. The first shows that computing n copies of a function f, even with a smal…