Author： Niedermeier R. Rossmanith P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.194, Iss.1, 1998-03, pp. : 137-161
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
Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. :
Access to resources
Recommend
Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. :
Lambda terms definable as combinators
By Bunder M.W.
Theoretical Computer Science, Vol. 169, Iss. 1, 1996-11 ,pp. :
The counting complexity of group-definable languages
By Arvind V. Vinodchandran N.V.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
Calculating reliability of the recursively definable networks
Automation and Remote Control, Vol. 71, Iss. 7, 2010-07 ,pp. :