Author:
Freund Yoav,Kearns Michael,Ron Dana,Rubinfeld Ronitt,Schapire Robert E.,Sellie Linda
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference28 articles.
1. Learning regular sets from queries and counterexamples;Angluin;Inform. and Comput.,1987
2. On the complexity of minimum inference of regular sets;Angluin;Inform. and Control,1978
3. Y. Azar, A. Z. Broder, A. R. Karlin, N. Linial, S. Phillips, 1992, Biased random walks, Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, 1, 9
4. Deciphering of sequential networks in the absence of an upper limit on the number of states;Barzdin';Sov. Phys. Dokl.,1970
5. Some tools for approximate 3-coloring;Blum;J. Assoc. Comput. Mach.,1994
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献