Author:
Boros Endre,Ibaraki Toshihide,Makino Kazuhisa
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference26 articles.
1. Complexity theoretic hardness results for query learning;Aizenstein;Comput. Complexity,1997
2. The complexity of approximability of finding maximum feasible sybsystems of linear relations;Amaldi;Theor. Comput. Sci.,1995
3. Queries and concept learning;Angluin;Mach. Learning,1988
4. Computational Learning Theory;Anthony,1992
5. Complexity of identification and dualization of positive Boolean functions;Bioch;Inform. and Comput.,1995
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献