2 citations · 3 across the 6 of their papers we have counts for
1 paper · 1 filter
Mart de Graaf, Ronald de Wolf
The classical Yao principle states that the complexity R_epsilon(f) of an optimal randomized algorithm for a function f with success probability 1-epsilon equals the complexity max…