Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Strategic directions in machine learning Read chapter Read first chapter

1993 | ReviewPaper | Chapter

Cryptographic limitations on learning Boolean formulae and finite automata

Authors : Michael J. Kearns, Leslie G. Valiant

Published in: Machine Learning: From Theory to Applications

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …
previous chapter Training a 3-node neural network is NP-complete
next chapter Inference of finite automata using homing sequences
Metadata
Title
Cryptographic limitations on learning Boolean formulae and finite automata
Authors
Michael J. Kearns
Leslie G. Valiant
Copyright Year
1993
Publisher
Springer Berlin Heidelberg
Book
Machine Learning: From Theory to Applications

Print ISBN: 978-3-540-56483-6

Electronic ISBN: 978-3-540-47568-2

Copyright Year: 1993

DOI
https://doi.org/10.1007/3-540-56483-7_21