Author： Maurin F.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.165, Iss.2, 1996-10, pp. : 247-273
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
Ordinal recursive bounds for Higman's theorem
Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. :
Access to resources
Recommend
Ordinal mind change complexity of language identification
By Ambainis A. Jain S. Sharma A.
Theoretical Computer Science, Vol. 220, Iss. 2, 1999-06 ,pp. :
Some complexity bounds for subtype inequalities
By Benke M.
Theoretical Computer Science, Vol. 212, Iss. 1, 1999-02 ,pp. :
Lower Bounds on the Multiparty Communication Complexity
Journal of Computer and System Sciences, Vol. 56, Iss. 1, 1998-02 ,pp. :
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. :