Author:
Harkins Ryan C.,Hitchcock John M.
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Aizenstein, H., Hegedüs, T., Hellerstein, L., Pitt, L.: Complexity theoretic hardness results for query learning. Computational Complexity 7, 19–53 (1998)
2. Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)
3. Lecture Notes in Computer Science;H. Buhrman,1992
4. Buhrman, H., van Melkebeek, D., Regan, K.W., Sivakumar, D., Strauss, M.: A generalization of resource-bounded measure, with application to the BPP vs. EXP problem. SIAM Journal on Computing 30(2), 576–601 (2001)
5. Fortnow, L., Klivans, A.R.: Efficient learning algorithms yield circuit lower bounds. Journal of Computer and System Sciences 75(1), 27–36 (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献