74 citations · 178 across the 85 of their papers we have counts for
1 paper · 2 filters
Dániel Gerbner
We consider problems that can be solved by asking certain queries. The deterministic query complexity D(P,n) of a problem P is the smallest number of queries needed to ask in o…