13 citations · 25 across the 15 of their papers we have counts for
1 paper · 2 filters
Aleksandrs Belovs, Eric Blais
We show that every algorithm for testing n-variate Boolean functions for monotonicity must have query complexity Ω~(n1/4). All previous lower bounds for this problem we…