Author： Freivalds R. Jain S.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.188, Iss.1, 1997-11, pp. : 175-194
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
Representations versus numberings: on the relationship of two computability notions
By Spreen D.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Access to resources
Recommend
Kolmogorov complexity and non-determinism
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
The Kolmogorov complexity of real numbers
By Staiger L.
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :
Logical operations and Kolmogorov complexity
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
Combinatorial interpretation of Kolmogorov complexity
By Romashchenko A. Shen A. Vereshchagin N.
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :