Information distance and conditional complexities
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5583062
- Interval entropy and informative distance
- scientific article; zbMATH DE number 7650931
- scientific article; zbMATH DE number 193625
- Information Distance and Its Applications
- INFORMATION DISTANCE AND ITS APPLICATIONS
- The information complexity of learning tasks, their structure and their distance
- Information distances in stochastic resolution analysis
Cites work
Cited in
(17)- On symmetry of information and polynomial time invertibility
- Normalized information distance and the oscillation hierarchy
- Topological arguments for Kolmogorov complexity
- On joint conditional complexity (entropy)
- Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity
- Partial match distance. In memoriam Ray Solomonoff 1926--2009
- POSSIBILISTIC INFORMATION METRICS AND DISTANCES: CHARACTERIZATIONS OF STRUCTURE
- INFORMATION DISTANCE AND ITS APPLICATIONS
- Prefix-free and prefix-correct complexities with compound conditions
- Information distance
- The information complexity of learning tasks, their structure and their distance
- Quantum information distance
- Information Distance in Multiples
- Kolmogorov Complexity with Error
- Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)
- Conditional complexity and codes
- Nonapproximability of the normalized information distance
This page was built for publication: Information distance and conditional complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958288)
