Learning in parallel

This publication has 13 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• Learnability and the Vapnik-Chervonenkis dimension
  Journal of the ACM, 1989
• Learning from noisy examples
  Machine Learning, 1988
• Occam's Razor
  Information Processing Letters, 1987
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• Parity, circuits, and the polynomial-time hierarchy
  Theory of Computing Systems, 1984
• Constant Depth Reducibility
  SIAM Journal on Computing, 1984
• The complexity of linear programming
  Theoretical Computer Science, 1980
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• Linear programming is log-space hard for P
  Information Processing Letters, 1979