7 citations · 17 across the 8 of their papers we have counts for
1 paper · 2 filters
Eric Blais, Joshua Brody
We establish two results regarding the query complexity of bounded-error randomized algorithms. * Bounded-error separation theorem. There exists a total function $f : \{0,1\}^n \to…