Author： Benke M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.212, Iss.1, 1999-02, pp. : 3-27
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
Satisfying subtype inequalities in polynomial space
By Frey A.
Theoretical Computer Science, Vol. 277, Iss. 1, 2002-04 ,pp. :
Access to resources
Recommend
Exact complexity bounds for ordinal addition
By Maurin F.
Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,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. :