The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
On the Complexity of Teaching
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
A Greedy Heuristic for the Set-Covering Problem
Chvatal, V. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.3.233 · Cited by 2,581
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
The knowledge complexity of interactive proof-systems
Goldwasser, S., Micali, S., & Rackoff, C. (1985) · Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 · doi:10.1145/22145.22178 · Cited by 1,302
Rivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
Natarajan, B. K. (1987) · doi:10.1145/28395.28427 · Cited by 139
Teachability in computational learning
Shinohara, A., & Miyano, S. (1991) · New Generation Computing · doi:10.1007/bf03037091 · Cited by 120
Learning Binary Relations and Total Orders
Goldman, S. A., Rivest, R. L., & Schapire, R. E. (1993) · SIAM Journal on Computing · doi:10.1137/0222062 · Cited by 64
Self-citationA computational model of teaching
Jackson, J. C., & Tomkins, A. (1992) · Conference on Learning Theory · doi:10.1145/130385.130421 · Cited by 47
Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
Goldman, S. A., Kearns, M. J., & Schapire, R. E. (1993) · SIAM Journal on Computing · doi:10.1137/0222047 · Cited by 42
Self-citationOn exact specification by examples
Anthony, M., Brightwell, G., Cohen, D., & Shawe-Taylor, J. S. (1992) · Conference on Learning Theory · doi:10.1145/130385.130420 · Cited by 42
Romantik, K., & Smith, C. H. (1994) · Computational Geometry · doi:10.1016/0925-7721(94)90005-1 · Cited by 23
Approximate testing and learnability
Romanik, K. (1992) · Conference on Learning Theory · doi:10.1145/130385.130422 · Cited by 16
Valiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
Huang, L., Joseph, A. D., Nelson, B., Rubinstein, B. I. P., & Tygar, J. D. (2011) · Proceedings of the 4th ACM workshop on Security and artificial intelligence · doi:10.1145/2046684.2046692 · Cited by 1,194
New Methods for Competitive Coevolution
Rosin, C. D., & Belew, R. K. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.1.1 · Cited by 578
Oracle-guided component-based program synthesis
Jha, S., Gulwani, S., Seshia, S. A., & Tiwari, A. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806833 · Cited by 510
Cooperative Inverse Reinforcement Learning
Hadfield-Menell, D., Dragan, A., Abbeel, P., & Russell, S. (2016) · arXiv · doi:10.48550/arxiv.1606.03137 · Cited by 413
Optimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.08.045 · Cited by 365
Metadata
- Authors
- Goldman, S. A., & Kearns, M. J.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1995-02
- Volume
- 50
- Issue
- 1
- Pages
- 20-31
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2020764470
- Cited by
- 257
- References
- 15
- FWCI
- 7.66
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.