Author:
Ben-David Shai,Eiron Nadav,Long Philip M.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference24 articles.
1. The complexity and approximability of finding maximum feasible subsystems of linear relations;Amaldi;Theoret. Comput. Sci.,1995
2. Learning from noisy examples;Angluin;Mach. Learning,1988
3. Hardness of approximate optima in lattices, codes, and linear systems;Arora;J. Comput. System Sci.,1997
4. P. Bartlett, S. Ben-David, Hardness results for neural network approximation problems, The 1999 IMA European Conference on Computational Learning Theory, 1999, pp. 50–62.
5. S. Ben-David, N. Eiron, H.U. Simon, On the hardness of unsupervised learning, 2000, to appear.
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献