Learning boolean formulae or finite automata is as hard as factoring
Year: 1988
Type: article
Author: Michael Kearns
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W3034905139