Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference18 articles.
1. Computational Learning Theory;Anthony,1992
2. Densité et dimension;Assouad;Ann. Inst. Fourier, Grenoble,1983
3. Approximable sets;Beigel;Inform. Comput.,1995
4. Quantifying the amount of verboseness;Beigel;Inform. Comput.,1995
5. Learnability and the Vapnik–Chervonenkis dimension;Blumer;J. Assoc. Comput. Mach.,1989
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A note on hardness of computing recursive teaching dimension;Information Processing Letters;2024-01
2. From undecidability of non-triviality and finiteness to undecidability of learnability;International Journal of Approximate Reasoning;2023-12
3. Computable PAC Learning of Continuous Features;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
4. A hierarchy of local decision;Theoretical Computer Science;2021-02
5. Beyond NP: Quantifying over Answer Sets;Theory and Practice of Logic Programming;2019-09