Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference46 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. H. Aizenstein, L. Hellerstein, L. Pitt, Read-thrice DNF is hard to learn with membership and equivalence queries, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992, 523, 532
3. H. Aizenstein, L. Pitt, Exact learning of read-twice DNF formulas, Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, 170, 179
4. H. Aizenstein, L. Pitt, Exact learning of read-k, Proceedings of the Fifth Annual Workshop on Computational Learning Theory, 1992, 71, 76
5. Queries and concept learning;Angluin;Mach. Learning,1988
Cited by
117 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献