10 citations · 10 across the 3 of their papers we have counts for
1 paper · 1 filter
Jenish C. Mehta
We show tight upper and lower bounds for switching lemmas obtained by the action of random p-restrictions on boolean functions that can be expressed as decision trees in which ev…