![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Duris P. Rolim J.D.P.
Publisher: Academic Press
ISSN: 0022-0000
Source: Journal of Computer and System Sciences, Vol.56, Iss.1, 1998-02, pp. : 90-95
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :