A lower bound for testing juntas

Hana Chockler, Dan Gutfreund

Abstract: We show an Ω (m) lower bound on the number of queries required to test whether a Boolean function depends on at most m out of its n variables. This improves a previously known lower bound for testing this property. Our proof is simple and uses only elementary techniques.