Algorithmic relative complexity
DOI10.3390/E13040902zbMATH Open1229.68046OpenAlexW2095699593MaRDI QIDQ657564FDOQ657564
Authors: Daniele Cerra, Mihai Datcu 
Publication date: 9 January 2012
Published in: Entropy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/e13040902
Recommendations
Kullback-Leibler divergencerelative entropycompressionKolmogorov complexitysimilarity measurecompression based distance
Measures of information, entropy (94A17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Relative complexity of random walks in random sceneries
- Kolmogorov complexity in perspective. II: Classification, information processing and duality
- Complementarity of information obtained by Kolmogorov and Aksentijevic-Gibson complexities in the analysis of binary time series
- Title not available (Why is that?)
- Expanding the algorithmic information theory frame for applications to Earth observation
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)
