Publisher
Springer International Publishing
Reference9 articles.
1. Ambos-Spies, K., Merkle, W., Terwijn, S.A.: Normalized information distance and the oscillation hierarchy. arXiv preprint
arXiv:1708.03583
(2017)
2. Bauwens, B.: Information distance revisited. In: Paul, C., Bläser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 154, pp. 46:1–46:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2020).
https://doi.org/10.4230/LIPIcs.STACS.2020.46
.
https://drops.dagstuhl.de/opus/volltexte/2020/11907
3. Bauwens, B., Shen, A.: Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity. J. Symb. Log. 79(2), 620–632 (2013)
4. Bennett, C.H., Gács, P., Li, M., Vitányi, P.M., Zurek, W.H.: Information distance. IEEE Trans. Inf. Theory 44(4), 1407–1423 (1998)
5. Gács, P.: On the symmetry of algorithmic information. Soviet Math. Dokl. 15, 1477–1480 (1974)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献