Author:
Bartlett Peter L.,Ben-David Shai
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Hardness of approximate optima in lattices, codes, and linear systems;Arora;J. Comput. System Sci.,1997
2. S. Ben-David, N. Eiron, P. Long, On the difficulty of approximately maximizing agreements, Proc. 13th Ann. Conference on Computational Learning Theory, 2000, pp. 266–274.
3. Training a 3-node neural network is NP-complete;Blum;Neural Networks,1992
4. On the complexity of training neural networks with continuous activation functions;DasGupta;IEEE Trans. Neural Networks,1995
5. Strong universal consistency of neural network classifiers;Faragó G. Lugosi;IEEE Trans. Inform. Theory,1993
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献