Anthony, Martin (2002) The sample complexity and computational complexity of Boolean function learning. CDAM research report series, LSE-CDAM-2002-13. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.Full text not available from this repository.
This report surveys some key results on the learning of Boolean functions in a probabilistic model that is a generalization of the well-known ‘PAC’ model. A version of this is to appear as a chapter in a book on Boolean functions, but the report itself is relatively self-contained.
|Item Type:||Monograph (Report)|
|Additional Information:||© 2002 the author|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics
Research centres and groups > Computational, Discrete and Applicable Mathematics@LSE (CDAM)
|Date Deposited:||16 Dec 2008 16:54|
Actions (login required)
|Record administration - authorised staff only|