Login Help

pages = 285--295 (1 entries)  Select: All None   Action: Show BibTeX

Michael Kearns, Ming Li, Leonard Pitt and Leslie G. Valiant. 1987. On the Learnability of Boolean Formulae. In Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, pp 285--295, New York, NY. ACM Press. [ML] google scholar

x$Id: bibtex.php,v 1.59 2021/01/12 08:36:11 dyuret Exp $   download