The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
When won't membership queries help?
Open accessAbstract
We investigate cryptographic limitations on the power of membership queries to help with concept learning.
Overview
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
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Bennett, C. H., & Gill, J. (1981) · SIAM Journal on Computing · doi:10.1137/0210008 · Cited by 381
Cited by
Cryptographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. (1994) · Journal of the ACM · doi:10.1145/174644.174647 · Cited by 733
Computational and evolutionary aspects of language
Nowak, M. A., Komarova, N. L., & Niyogi, P. (2002) · Nature · doi:10.1038/nature00771 · Cited by 444
Number-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646134 · Cited by 353
Cryptographic Primitives Based on Hard Learning Problems
Blum, A., Furst, M., Kearns, M., & Lipton, R. J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_24 · Cited by 332
Guest Column: A Survey of Quantum Learning Theory
Arunachalam, S., & de Wolf, R. (2017) · ACM SIGACT News · doi:10.1145/3106700.3106710 · Cited by 152
Metadata
- Authors
- Angluin, D., & Kharitonov, M.
- Venue
- Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91
- Publisher
- ACM Press
- Published
- 1991
- Pages
- 444-454
- OpenAlex
- W2018908820
- Cited by
- 190
- References
- 2
- FWCI
- 14.26
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: When won't membership queries help? https://app.cochat.ai/papers/10.1145/103418.103420
- The paper
- Angluin, D., & Kharitonov, M. (1991). When won't membership queries help? Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91. https://doi.org/10.1145/103418.103420
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.
