Author:
Nock Richard,Nielsen Frank
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. P. Bartlett, S. Ben-David, Hardness results for neural network approximation problems. in: Proc. of the 4th European Conf. on Computational Learning Theory, 1999, pp. 50–62
2. S. Ben-David, N. Eiron, P. Long, On the difficulty of approximately maximizing agreement, in: Proc. of the 13th International Conference on Computational Learning Theory, 2000 pp. 266–274
3. P. Berman, M. Karpinsky, On some tighter inapproximability results, in: Proc. of the 26th International Colloquium on Automata, Languages and Programming, 1999, pp. 200–209
4. Maximizing agreements and coagnostic learning;Bshouty;Theoretical Computer Science,2006
5. U. Feige, A threshold of ln n for approximating set cover, in: Proc. of the 28th ACM STOC, 1996, pp. 314–318