On the difficulty of approximately maximizing agreements☆
Under an Elsevier user license
open archive
Keywords
Machine learning
Computational learning theory
Neural networks
Inapproximability
Hardness
Half-spaces
Axis-aligned hyper-rectangles
Balls
Monomials
Cited by (0)
- ☆
An early version of this paper appeared in the Proceedings of the Thirteenth Annual Conference on Computational Learning Theory, 2000.
Copyright © 2003 Elsevier Science (USA). All rights reserved.