The complexity and approximability of finding maximum feasible subsystems of linear relations

This publication has 19 references indexed in Scilit:

• Derandomized graph products
  computational complexity, 1995
• On the hardness of approximating minimization problems
  Journal of the ACM, 1994
• A well-characterized approximation problem
  Information Processing Letters, 1993
• On learning simple neural concepts: from halfspace intersections to neural decision lists
  Network: Computation in Neural Systems, 1993
• Optimization, approximation, and complexity classes
  Journal of Computer and System Sciences, 1991
• The Upstart Algorithm: A Method for Constructing and Training Feedforward Neural Networks
  Neural Computation, 1990
• Perceptron-based learning algorithms
  IEEE Transactions on Neural Networks, 1990
• A Convergence Theorem for Sequential Learning in Two-Layer Perceptrons
  Europhysics Letters, 1990
• Explicit construction of linear sized tolerant networks
  Discrete Mathematics, 1988
• The densest hemisphere problem
  Theoretical Computer Science, 1978