Algorithmic relative complexity
From MaRDI portal
Publication:657564
Recommendations
Cites work
- scientific article; zbMATH DE number 5608251 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- A Mathematical Theory of Communication
- A formal theory of inductive inference. Part I
- A measure of relative entropy between individual sequences with application to universal classification
- An introduction to Kolmogorov complexity and its applications
- Clustering by Compression
- On Information and Sufficiency
- On the Length of Programs for Computing Finite Binary Sequences
- Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity
- Shared Information and Program Plagiarism Detection
- The Similarity Metric
- Three approaches to the quantitative definition of information*
Cited in
(6)- Algorithmic folding complexity
- Complementarity of information obtained by Kolmogorov and Aksentijevic-Gibson complexities in the analysis of binary time series
- Expanding the algorithmic information theory frame for applications to Earth observation
- scientific article; zbMATH DE number 6026956 (Why is no real title available?)
- Relative complexity of random walks in random sceneries
- Kolmogorov complexity in perspective. II: Classification, information processing and duality
This page was built for publication: Algorithmic relative complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657564)