Author:
Bulatov Andrei,Chen Hubie,Dalmau Víctor
Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. Queries and concept learning;Angluin;Machine Learning,1988
2. P. Auer, N. Cesa-Bianchi, On-line learning with malicious noise and the closure algorithm, Annals of Mathematics and Artificial Intelligence 23 (1–2) 83–99
3. Quantified constraints and surjective polymorphisms;Börner,2003
4. N. Bshouty, J. Jackson, C. Tamon, Exploiring learnability between exact and PAC, in: 15th Annual ACM Conference on Computational Learning Theory, COLT’02, 2002, pp. 244–254
5. H. Chen, The computational complexity of quantified constraint satisfaction, Ph.D. Thesis, Cornell University, 2004
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献