Kearns M, Valiant LG. (1988). Learning boolean formulae or finite automata is ashard as factoring Tech Rep TR-14-88 Harvard University Aiken Computation Laboratory.

See more from authors: Kearns M · Valiant LG

References and models cited by this paper
References and models that cite this paper

Murata N, Takenouchi T, Kanamori T, Eguchi S. (2004). Information geometry of U-Boost and Bregman divergence. Neural computation. 16 [PubMed]

This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.