Composite Geometric Concepts and Polynomial Predictability

This publication has 11 references indexed in Scilit:

• A Polynomial Time Algorithm That Learns Two Hidden Unit Nets
  Neural Computation, 1990
• Learnability and the Vapnik-Chervonenkis dimension
  Journal of the ACM, 1989
• Computational limitations on learning from examples
  Journal of the ACM, 1988
• Predicting (0, 1)-functions on randomly drawn points
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• On the existence of pseudorandom generators
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• One way functions and pseudorandom generators
  Combinatorica, 1987
• Occam's Razor
  Information Processing Letters, 1987
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• A theory of the learnable
  Communications of the ACM, 1984
• The monotone and planar circuit value problems are log space complete for P
  ACM SIGACT News, 1977