Learning Boolean Formulae or Finite Automata is as Hard as Factoring
| Authored By: | M. Kearns and L. G. Valiant |
| Paper Title: | Learning Boolean Formulae or Finite Automata is as Hard as Factoring |
| Number TR 14-88 | |
| Publisher: | Harvard University Aiken Computation Laboratory |
| Publication Date: | 1988 |