 Valiant, L. G. 

 Angluin, D.  Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings  1979 
 Valiant, L. G.  A Theory of the Learnable  November 1984 
 Valiant, L. G.  Learning Disjunctions of Conjunctions  1985 
 Kearns, M.  Learning Boolean Formulae or Finite Automata is as Hard as Factoring  1988 
 Valiant, L. G.  Functionality in neural networks  1988 
 Kearns, M.  Cryptographic limitations on learning Boolean formulae and finite automata  1989 
 Ehrenfeucht, A.  A general lower bound on the number of examples needed for learning  1989 
