Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87–106 (1987)
2. Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
3. Lecture Notes in Computer Science;B. Barak,2002
4. Lecture Notes in Computer Science;H. Buhrman,1999
5. Buhrman, H., Fortnow, L., Thierauf, T.: Nonrelativizing separations. In: Proceedings of the 13th Annual IEEE Conference on Computational Complexity (CCC), pp. 8–12 (1998)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Power of Natural Properties as Oracles;computational complexity;2023-07-06
2. Quantum learning algorithms imply circuit lower bounds;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02