Learning DNF by approximating inclusion-exclusion formulae

We analyze upper and lower bounds on size of Boolean conjunctions necessary and sufficient to approximate a given DNF formula by accuracy slightly better than 1/2 (here we define the size of a Boolean conjunction as the number of distinct variables on which it depends). Such an analysis determines the performance of a naive search algorithm that exhausts Boolean conjunctions in the order of their sizes. In fact, our analysis does not depend on kinds of symmetric functions to be exhausted: instead of conjunctions, counting either disjunctions, parity functions, majority functions, or even general symmetric functions, derives the same learning results from similar analyses