A proof of the Beyer-Stein-Ulam relation between complexity and entropy
type: Item
instance of: scholarly article
title: A proof of the Beyer-Stein-Ulam relation between complexity and entropy
zbMATH Open document ID: 0971.68078
DOI: 10.1016/S0012-365X(00)00100-X
author: Stefano Galatolo
published in: Discrete Mathematics
publication date: 2000-12-03T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 94A17
zbMATH DE Number: 1538221
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: information entropy
MaRDI profile type: Publication
full work available at URL: s0012-365x(00)00100-x
OpenAlex ID: W2052047179
Recommended article: A note on Kolmogorov complexity and entropy
Recommended article: An entropy proof of the Kahn-Lovász theorem
Recommended article: A simple proof of Wehrl's conjecture on entropy
Recommended article: A simple proof of the entropy-power inequality
Recommended article: The Complexity of Approximating the Entropy
Recommended article: Q4336750
Recommended article: Inequalities for Shannon entropy and Kolmogorov complexity
Recommended article: An entropy proof of Bregman's theorem
Recommended article: Relative entropy and the Bekenstein bound
description: scientific article; zbMATH DE number 1538221