|
This article is cited in 2 scientific papers (total in 2 papers)
Two decades of applied Kolmogorov complexity.
P. Vitányi, M. Li
Full text:
PDF file (2898 kB)
References:
PDF file
HTML file
Bibliographic databases:
UDC:
519.217
Citation:
P. Vitányi, M. Li, “Two decades of applied Kolmogorov complexity.”, Uspekhi Mat. Nauk, 43:6(264) (1988), 129–166
Citation in format AMSBIB
\Bibitem{VitLi88}
\by P.~Vit\'anyi, M.~Li
\paper Two decades of~applied Kolmogorov complexity.
\jour Uspekhi Mat. Nauk
\yr 1988
\vol 43
\issue 6(264)
\pages 129--166
\mathnet{http://mi.mathnet.ru/umn2050}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=983881}
\zmath{https://zbmath.org/?q=an:0664.68006}
Linking options:
http://mi.mathnet.ru/eng/umn2050 http://mi.mathnet.ru/eng/umn/v43/i6/p129
Citing articles on Google Scholar:
Russian citations,
English citations
Related articles on Google Scholar:
Russian articles,
English articles
This publication is cited in the following articles:
-
V. A. Uspenskii, A. L. Semenov, A. Kh. Shen', “Can an individual sequence of zeros and ones be random?”, Russian Math. Surveys, 45:1 (1990), 121–189
-
Uspensky V.A., V'yugin V.V., “Development of the algorithmic information theory in Russia”, Journal of Communications Technology and Electronics, 56:6 (2011), 739–747
|
Number of views: |
This page: | 974 | Full text: | 480 | References: | 58 | First page: | 6 |
|