37 citations · 47 across the 4 of their papers we have counts for
1 paper · 1 filter
Shalev Ben-David, Robin Kothari
A long-standing open question in query complexity asks whether there is a total Boolean function f with R(f) << C(f), where R(f) and C(f) denote its bounded-error randomized query…