![Computational sample complexity and attribute-efficient learning | Proceedings of the thirty-first annual ACM symposium on Theory of Computing Computational sample complexity and attribute-efficient learning | Proceedings of the thirty-first annual ACM symposium on Theory of Computing](https://dl.acm.org/cms/asset/ea71385d-bb7e-474f-bedb-cff2e622f0b7/301250.301437.fp.png)
Computational sample complexity and attribute-efficient learning | Proceedings of the thirty-first annual ACM symposium on Theory of Computing
![Computational learning theory | Pattern recognition and machine learning | Cambridge University Press Computational learning theory | Pattern recognition and machine learning | Cambridge University Press](http://assets.cambridge.org/97805214/16030/cover/9780521416030.gif)
Computational learning theory | Pattern recognition and machine learning | Cambridge University Press
![Amazon.com: Machine Learning in Finance: From Theory to Practice: 9783030410674: Dixon, Matthew F., Halperin, Igor, Bilokon, Paul: Books Amazon.com: Machine Learning in Finance: From Theory to Practice: 9783030410674: Dixon, Matthew F., Halperin, Igor, Bilokon, Paul: Books](https://m.media-amazon.com/images/I/41rsOXuWB4L._AC_SY780_.jpg)
Amazon.com: Machine Learning in Finance: From Theory to Practice: 9783030410674: Dixon, Matthew F., Halperin, Igor, Bilokon, Paul: Books
![Crytographic limitations on learning Boolean formulae and finite automata | Proceedings of the twenty-first annual ACM symposium on Theory of computing Crytographic limitations on learning Boolean formulae and finite automata | Proceedings of the twenty-first annual ACM symposium on Theory of computing](https://dl.acm.org/cms/asset/5409878e-e875-4a59-a584-b73bd593fdf3/73007.73049.fp.png)