On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
Open Access
- 1 December 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 209 (1-2) , 237-260
- https://doi.org/10.1016/s0304-3975(97)00115-1
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Packing directed circuits fractionallyCombinatorica, 1995
- Robust Trainability of Single NeuronsJournal of Computer and System Sciences, 1995
- The minimum feature set problemNeural Networks, 1994
- Misclassification minimizationJournal of Global Optimization, 1994
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Cryptographic limitations on learning Boolean formulae and finite automataJournal of the ACM, 1994
- A "Thermal" Perceptron Learning RuleNeural Computation, 1992
- Perceptron-based learning algorithmsIEEE Transactions on Neural Networks, 1990
- A theory of the learnableCommunications of the ACM, 1984
- Inductive Inference: Theory and MethodsACM Computing Surveys, 1983