Author:
Chen Zhixiang,Ameur Foued
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference29 articles.
1. H. Aizenstein, L. Hellerstein, and L. Pitt, Read-thrice DNF is hard to learn with membership and equivalence queries, in Proc. of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, 1992, pp. 523–532.
2. H. Aizenstein and L. Pitt, Exact learning of read-twice DNF formulas, in Proc. of the 33rd Annual IEEE Symposium on the Foundations of Computer Science, 1991, pp. 170–179.
3. A space-bounded learning algorithm for axis-parallel rectangles;Ameur,1995
4. Queries and concept learning;Angluin;Mach. Learning,1988
5. Learning read-once formulas with queries;Angluin;J. Assoc. Comput. Mach.,1993
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献