Author:
Bshouty Nader H.,Burroughs Lynn
Subject
General Computer Science,Theoretical Computer Science
Reference18 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,1987
3. Computational learning theory, Cambridge Tracts in Theoretical Computer Science;Anthony,1992
4. P.L. Barlett, S. Ben-David, Hardness results for neural network approximation problems, 4th Euro-COLT, 1999, pp. 50–62.
5. S. Ben-David, N. Eiron, P.M. Long, On the difficulty of approximately maximizing agreements, 13th COLT, 2002, pp. 266–274.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Geometric Model of Opinion Polarization;Mathematics of Operations Research;2023-02-02
2. Complexity theoretic limitations on learning halfspaces;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19
3. An Improved Branch-and-Bound Method for Maximum Monomial Agreement;INFORMS Journal on Computing;2012-05
4. Agnostic Learning of Monomials by Halfspaces Is Hard;SIAM Journal on Computing;2012-01
5. Agnostic Learning of Monomials by Halfspaces Is Hard;2009 50th Annual IEEE Symposium on Foundations of Computer Science;2009-10