“…Assuming a set of (n, (s, r))-CFF of size N can be constructed in time T , this algorithm learns s-term r-MDNF with N queries in time O( n r + T ). In [20,9], it is shown that any set A ⊂ {0, 1} n that non-adaptively learns s-term r-MDNF is an (n, (s − 1, r))-CFF. Therefore, the minimum size of an (n, (s − 1, r))-CFF is also a lower bound for the number of queries (and therefore also for the time) for non-adaptively learning s-term r-MDNF.…”