Centre for Discrete and Applicable Mathematics

 CDAM Research Report, LSE-CDAM-2002-13

December 2002


The Sample Complexity and Computational Complexity of Boolean Function Learning

Martin Anthony

Abstract

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.


A PDF file (186 kB) with the full contents of this report can be downloaded by clicking here.

Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2002-13, together with your name and postal address to:
CDAM Research Reports Series
Centre for Discrete and Applicable Mathematics
London School of Economics
Houghton Street
London WC2A 2AE, U.K.
Phone: +44(0)-20-7955 7732.
Fax: +44(0)-20-7955 6877.
Email: info@maths.lse.ac.uk


Introduction to the CDAM Research Report Series.
CDAM Homepage.


Copyright © London School of Economics & Political Science 2005

Last changed: Wed 9 Feb 2005
For comments go to: http://www.maths.lse.ac.uk/webmaster.html