Nonapproximability of the normalized information distance
From MaRDI portal
(Redirected from Publication:716306)
Recommendations
Cites work
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- An introduction to Kolmogorov complexity and its applications
- Clustering by Compression
- Independent minimum length programs to translate between given strings
- Information distance
- Information distance and conditional complexities
- Logical operations and Kolmogorov complexity
- Notes on sum-tests and independence tests
- Systems of strings with high mutual complexity
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The Similarity Metric
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
Cited in
(10)- Evaluating the Impact of Information Distortion on Normalized Compression Distance
- The Normalized Algorithmic Information Distance Can Not Be Approximated
- Compression-based distance between string data and its application to literary work classification based on authorship
- A safe approximation for Kolmogorov complexity
- Normalized Information Distance
- Applying a normalized compression metric to the measurement of dialect distance
- Normalized information distance and the oscillation hierarchy
- Similarity and denoising
- Preliminary results on masquerader detection using compression based similarity metrics
- The Normalized Compression Distance Is Resistant to Noise
This page was built for publication: Nonapproximability of the normalized information distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716306)