Author： Blaser M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.284, Iss.2, 2002-07, pp. : 199-206
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
Computational complexity of functions
By Levin L.A.
Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. :
Access to resources
Recommend
On the Computational Complexity of P Automata
By Csuhaj-Varjú Erzsébet Ibarra Oscar Vaszil György
Natural Computing, Vol. 5, Iss. 2, 2006-05 ,pp. :
On the computational complexity of infinite words
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
On computational complexity of contextual languages
By Ilie L.
Theoretical Computer Science, Vol. 183, Iss. 1, 1997-08 ,pp. :