Article citationsMore>>

Kearns, M. and Valiant, L.G. (1989) Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. 21st Annual ACM Symposium on the Theory of Computing, Seattle, Washington, USA, May 14-17 1989, 433-444.
https://doi.org/10.1145/73007.73049

has been cited by the following article:

Follow SCIRP
Twitter Facebook Linkedin Weibo
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top