![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Wang Y.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.237, Iss.1, 2000-04, pp. : 33-55
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
On resource-bounded instance complexity
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Resource bounded randomness and weakly complete problems
By Ambos-Spies K. Terwijn S.A. Xizhong Z.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :