Search for Author All Reviews
	Bshouty, Nader H.     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       Polynomial multiplication over finite fields: from quadratic to straight-line complexity Bshouty N., Kaminski M. Computational Complexity 15(3): 252-262, 2006.  Type: Article Let &lgr;(n) be the number of multiplications/divisions required to compute the coefficients of the product of a polynomial of degree n and a polynomial of degree n-1 ove...... Aug 15 2007     Learning functions represented as multiplicity automata Beimel A., Bergadano F., Bshouty N., Kushilevitz E., Varricchio S. Journal of the ACM 47(3): 506-530, 2000.  Type: Article One of the earliest paradigms for feasible exact learning,  Angluin’s  formulation of learning from membership and equivalence queries, continues to supply a framework for new and interesting results. More s...... Jul 1 2000     Noise-tolerant distribution-free learning of general geometric concepts Bshouty N., Goldman S., Mathias H., Suri S., Tamaki H. Journal of the ACM 45(5): 863-890, 1998.  Type: Article Valiant’s probably approximately correct (PAC) learning model has been remarkably fruitful in focusing learning research since its introduction 15 years ago [1]. One line of research has asked whether various geometric concep...... May 1 1999
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy