![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Dai J.J.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.292, Iss.3, 2003-01, pp. : 723-732
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)
An improved zero-one law for algorithmically random sequences
By Kautz S.M.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
![](/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)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Resource-bounded Relational Reasoning:Induction and Deduction Through Stochastic Matching
By Sebag M.
Machine Learning, Vol. 38, Iss. 1-2, 2000-01 ,pp. :