Fetching the paper…
Reading the bibliography…
We consider the problem of PAC-learning decision trees, i.e., learning a decision tree over the n-dimensional hypercube from independent random labeled examples.
L. Valiant
1984
Earlier work this paper cites.
A. Ehrenfeucht and D. Haussler
1989
Earlier work this paper cites.
O. Goldreich and L. Levin
1989
Earlier work this paper cites.
E. Kushilevitz and Y. Mansour
1993
Earlier work this paper cites.
J. Jackson
1997
Cited alongside, same era.
T. M. Mitchell
1997
Cited alongside, same era.
J. Jackson and R. Servedio
2003
Cited alongside, same era.
E. Mossel, R. O’Donnell, and R. Servedio
2003
Cited alongside, same era.
R. Selten
Cited in the paper.
D. A. Spielman and S.-H. Teng
2004
Later among the works it cites.
To appear in Journal of Computer and System Sciences
N. Bshouty, E. Mossel, R. O’Donnell, and R. Servedio · 2005
Later among the works it cites.
P. Gopalan, A. T. Kalai, and A. R. Klivans
2008
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…