Author： Apolloni B. Gentile C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 141-162
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
Access to resources
Recommend
Improved Bounds on the Sample Complexity of Learning
By Li Y. Long P.M. Srinivasan A.
Journal of Computer and System Sciences, Vol. 62, Iss. 3, 2001-05 ,pp. :
Removing Ramsey theory: Lower bounds with smaller domain size
By Edmonds J.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. :
Lower Bounds on the Multiparty Communication Complexity
Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. :