1 citations · 1 across the 1 of their papers we have counts for
1 paper
Andrew Bassilakis, Andrew Drucker, Mika Göös +3
The randomized query complexity R(f) of a boolean function f:{0,1}n→{0,1} is famously characterized (via Yao's minimax) by the least number of queries needed to dis…