Article ID Journal Published Year Pages File Type
9657169 Journal of Computer and System Sciences 2005 36 Pages PDF
Abstract
Versions of (a)-(c) were known previously, but the previous versions applied to polynomial-time learning and used complexity theoretic assumptions. In contrast, (a)-(c) apply to polynomial-query learning, imply the results for polynomial-time learning, and do not use any complexity-theoretic assumptions.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Exact learning of DNF formulas using DNF hypotheses
Authors
, ,