Article Free Access Share on On the learnability of Boolean formulae Authors: M. Kearns Harvard University Harvard UniversityView Profile , M. Li Harvard University Harvard UniversityView Profile , L. Pitt University of Illinois University of IllinoisView Profile , L. Valiant Harvard University Harvard UniversityView Profile Authors Info & Claims STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computingJanuary 1987 Pages 285–295https://doi.org/10.1145/28395.28426Online:01 January 1987Publication History 157citation769DownloadsMetricsTotal Citations157Total Downloads769Last 12 Months62Last 6 weeks5 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
No takes yet. Share an insight, caveat, or question.
Kearns et al. (1987) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: