![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Fortnow L. Kummer M.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.161, Iss.1, 1996-07, pp. : 123-140
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)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Resource bounded randomness and computational complexity
By Wang Y.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
![](/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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
A stronger Kolmogorov zero-one law for resource-bounded measure
By Dai J.J.
Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. :