Author:
Hellerstein Lisa,Raghavan Vijay
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference35 articles.
1. Complexity theoretic hardness results for query learning;Aizenstein;Comput. Complexity,1998
2. Queries and concept learning;Angluin;Mach. Learning,1988
3. When won’t membership queries help?;Angluin;J. Comput. System Sci.,1995
4. On the applications of multiplicity automata in learning;Beimel,1996
5. Linear time deterministic learning of k-term DNF;Berggren,1993
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Class of Polynomially Verifiable Circuits of Logarithmic Depth;2023 13th International Conference on Cloud Computing, Data Science & Engineering (Confluence);2023-01-19
2. On Exactly Learning Disjunctions and DNFs Without Equivalence Queries;Lecture Notes in Computer Science;2019
3. Certificate Complexity and Exact Learning;Encyclopedia of Algorithms;2016
4. Certificate Complexity and Exact Learning;Encyclopedia of Algorithms;2015
5. ALLQBF Solving by Computational Learning;Automated Technology for Verification and Analysis;2012