Keyword

polynomial-time learnability

Description: A property of a concept class or formal language indicating that it can be learned within polynomial time under a specified learning model.
OpenAlex ID: keywords/polynomial-time-learnability
1987 · Ronald L. Rivest · Machine Learning · 1,052
1987 · M. Kearns, M. Li, et al. · ACM Symposium on Theory of Computing (STOC) · 308
1995 · N.H. Bshouty · Information and Computation · 174
1987 · MICHAEL KEARNS, MING LI, et al. · Elsevier eBooks · 126
1990 · Karsten Verbeurgt · Elsevier eBooks · 119
2017 · Daniely, Amit · arXiv (Cornell University) · 115
1996 · Lisa Hellerstein, Krishnan Pillaipakkamnatt, et al. · Journal of the ACM · 106
1993 · Setsuo Arikawa, Satoru Miyano, et al. · New Generation Computing · 91
1988 · David Haussler, Michael Kearns, et al. · Conference on Learning Theory · 85
1991 · Ming Li, Paul M. B. Vitányi · SIAM Journal on Computing · 82
1990 · Eric B Baum · Journal of Complexity · 80
1994 · ROLF WIEHAGEN, THOMAS ZEUGMANN · Journal of Experimental & Theoretical Artificial Intelligence · 61
2010 · Alexander Clark · Lecture notes in computer science · 59
2010 · Moitra, Ankur, Valiant, Gregory · arXiv (Cornell University) · 57
1990 · Hiroki Ishizaka · Machine Learning · 57
1995 · B. DasGupta, H.T. Siegelmann, et al. · IEEE Transactions on Neural Networks · 53
1994 · Stephen Muggleton · Conference on Learning Theory · 52
2003 · Takashi Yokomori · Theoretical Computer Science · 50
1987 · Piotr Berman, Robert Roos · Annual Symposium on Foundations of Computer Science · 50
2017 · Konev, Boris, Lutz, Carsten, et al. · arXiv (Cornell University) · 45
1997 · Dana Angluin, Mārtiņš Kriķis, et al. · Machine Learning · 43
Works count: 243
Citation count: 4,893
Year
Topic
Type