Key points are not available for this paper at this time.
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
Kearns et al. (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: