Resource title

The sample complexity and computational complexity of Boolean function learning

Resource image

image for OpenScout resource :: The sample complexity and computational complexity of Boolean function learning

Resource description

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.

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/13569/

Resource license