A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02
We show the following: (a) For any > 0, log (3+ ) n-term DNF cannot be polynomial-query learned with membership and strongly proper equivalence queries. (b) For sufficiently large t, t-term DNF formulas cannot be polynomialquery learned with membership and equivalence queries that use t 1+ -term DNF formulas as hypotheses, for some < 1 (c) Read-thrice DNF formulas are not polynomial-query learnable with membership and proper equivalence queries. (d) log n-term DNF formulas can bedoi:10.1145/509973.509976 fatcat:sfy4f2eu25cnrdl6hekeitvowa