Anthony, Martin 
ORCID: 0000-0002-7796-6044
(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.
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.
| Item Type: | Monograph (Report) |
|---|---|
| Official URL: | http://www.cdam.lse.ac.uk |
| Additional Information: | © 2002 the author |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 16 Dec 2008 16:54 |
| Last Modified: | 01 Nov 2024 05:03 |
| URI: | http://eprints.lse.ac.uk/id/eprint/13569 |
Actions (login required)
 |
View Item |
