Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference15 articles.
1. Learning regular sets from queries and counterexamples;Angluin;Information and Computation,1987
2. Symbolic boolean manipulation with ordered binary-decision diagrams;Bryant;ACM Computing Surveys,1992
3. F. Bergadano, N. Bshouty, C. Tamon, S. Varricchio, On learning branching programs and small circuits, in: Proceedings of the 3rd European Conference on Computational Learning Theory, Lecture Notes in Artificial Intelligence, vol. 1208, 1997, pp. 150–161.
4. Using computational learning strategies as a tool for combinatorial optimization;Birkendorf;Annals of Mathematics and Artificial Intelligence,1998
5. N. Bshouty, C. Tamon, D. Wilson, On learning width two branching programs, in: Proceedings of the 9th Annual Conference on Computational Learning Theory, 1996, pp. 224–227.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献