Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.39, Iss.4, 2003-10, pp. : 380-394

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Kolmogorov complexity and non-determinism

By Grigorieff S. Marion J.

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 151-180

Elsevier

Access to resources Recommend Favorite

The Kolmogorov complexity of real numbers

By Staiger L.

Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. : 455-466

Elsevier

Access to resources Recommend Favorite

Logical operations and Kolmogorov complexity

By Shen A. Vereshchagin N.

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 125-129

Elsevier

Access to resources Recommend Favorite

Combinatorial interpretation of Kolmogorov complexity

By Romashchenko A. Shen A. Vereshchagin N.

Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. : 111-123

Elsevier

Access to resources Recommend Favorite

On data mining, compression, and Kolmogorov complexity

By Faloutsos Christos Megalooikonomou Vasileios

Data Mining and Knowledge Discovery, Vol. 15, Iss. 1, 2007-08 ,pp. : 3-20

Springer Publishing Company

Access to resources Recommend Favorite