Intrinsic Complexity of Learning Geometrical Concepts from Positive Data

Jain and Kinber. "Intrinsic Complexity of Learning Geometrical Concepts from Positive Data." Annual Conference on Computational Learning Theory, 2001. doi:10.1007/3-540-44581-1_12

[Jain and Kinber. "Intrinsic Complexity of Learning Geometrical Concepts from Positive Data." Annual Conference on Computational Learning Theory, 2001.](https://mlanthology.org/colt/2001/jain2001colt-intrinsic/) doi:10.1007/3-540-44581-1_12

@inproceedings{jain2001colt-intrinsic,
  title     = {{Intrinsic Complexity of Learning Geometrical Concepts from Positive Data}},
  author    = {Jain, Sanjay and Kinber, Efim B.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2001},
  pages     = {177-193},
  doi       = {10.1007/3-540-44581-1_12},
  url       = {https://mlanthology.org/colt/2001/jain2001colt-intrinsic/}
}