The DOI matches its Crossref record.
Crytographic limitations on learning Boolean formulae and finite automata
Abstract
Article Free Access Share on Crytographic limitations on learning Boolean formulae and finite automata Authors: M. Kearns Harvard University Harvard UniversityView Profile , L. G. Valiant Harvard University Harvard UniversityView Profile Authors Info & Claims STOC '89: Proceedings of the twenty-first annual ACM symposium on Theory of computingFebruary 1989 Pages 433–444https://doi.org/10.1145/73007.73049Published:01 February 1989Publication History 144citation661DownloadsMetricsTotal Citations144Total Downloads661Last 12 Months75Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
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
Cited by
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
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
A Survey of Ensemble Learning: Concepts, Algorithms, Applications, and Prospects
Mienye, I. D., & Sun, Y. (2022) · IEEE Access · doi:10.1109/access.2022.3207287 · Cited by 1,298
Constant depth circuits, Fourier transform, and learnability
Linial, N., Mansour, Y., & Nisan, N. (1993) · Journal of the ACM · doi:10.1145/174130.174138 · Cited by 572
A fast automaton-based method for detecting anomalous program behaviors
Sekar, R., Bendre, M., Dhurjati, D., & Bollineni, P. (2002) · Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001 · doi:10.1109/secpri.2001.924295 · Cited by 554
Metadata
- Authors
- Kearns, M., & Valiant, L. G.
- Venue
- Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
- Publisher
- ACM Press
- Published
- 1989
- Pages
- 433-444
- OpenAlex
- W2157526632
- Cited by
- 266
- References
- 0
- FWCI
- 13.83
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Crytographic limitations on learning Boolean formulae and finite automata. https://app.cochat.ai/papers/10.1145/73007.73049
- The paper
- Kearns, M., & Valiant, L. G. (1989). Crytographic limitations on learning Boolean formulae and finite automata. Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. https://doi.org/10.1145/73007.73049
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.
