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

Theoretical Computer Science

Volumn 147, Issue 1-2, 1995, Pages 181-210

  Amaldi, Edoardo ^a   Kann, Viggo ^b  

^a EPFL   (Switzerland)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LEARNING SYSTEMS; NEURAL NETWORKS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMABILITY; APX COMPLETE PROBLEMS; LINEAR RELATIONS; MAXIMUM FEASIBLE SUBSYSTEMS;

COMBINATORIAL MATHEMATICS;

EID: 0029638653     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(94)00254-G     Document Type: Article

References (40)

1. Explicit construction of linear sized tolerant networks
2. On the complexity of training perceptrons
3. The hardness of approximate optima in lattices, codes, and systems of linear equations
4. Proof verification and hardness of approximation problems
5. Efficient probabilistically checkable proofs and applications to approximation
6. On the complexity of approximating the independent set problem
7. Completeness in approximation classes
8. The upstart algorithm a method for constructing and training feedforward neural networks
9. Perceptron-based learning algorithms
10. Approaches to diagnosing infeasible linear programs
11. Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations
12. A well-characterized approximation problem
13. Approximation algorithms for combinatorial problems
14. The densest hemisphere problem
15. On the second eigenvalue and linear expansion of regular graphs
16. On the approximability of NP-complete optimization problems
17. Polynomially bounded minimization problems that are hard to approximate
18. A new polynomial time algorithm for linear programming
19. On syntactic versus computational views of approximability
20. Logical definability of NP optimization problems
21. Ramanujan graphs
22. On the hardness of approximating minimization problems
23. An approximate algorithm to find the largest linearly separable subset of training examples
24. On learning simple neural concepts: from halfspace intersections to neural decision lists
25. A convergence theorem for sequential learning in two-layer perceptrons
26. Quantifiers and approximation
27. Optimization, approximation, and complexity classes
28. Theory of Linear and Integer Programming
29. An algorithm for optimal solution of linear inequalities and its application to pattern recognition
30. On the approximation of maximum satisfiability