Dimension is compression
type: Item
instance of: scholarly article
title: Dimension is compression
zbMATH Open document ID: 1283.68175
author: María López-Valdés
author: Elvira Mayordomo
published in: Theory of Computing Systems
publication date: 2013-04-15T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 28A80
Mathematics Subject Classification ID: 28A78
Mathematics Subject Classification ID: 68P30
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 37B05
zbMATH DE Number: 6153892
zbMATH Keywords: computational complexity
zbMATH Keywords: information theory
zbMATH Keywords: effective dimension
MaRDI profile type: Publication
full work available at URL: s00224-012-9417-0
OpenAlex ID: W2079462430
Wikidata QID: Q60578949
cites work: Bounded Pushdown Dimension vs Lempel Ziv Information Density
cites work: Effective Strong Dimension in Algorithmic Information and Computational Complexity
cites work: Algorithms and Computation
cites work: Compressibility and resource bounded measure
cites work: On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line
cites work: Q4023085
cites work: Finite-state dimension
cites work: Algorithmic Randomness and Complexity
cites work: MAX3SAT is exponentially hard to approximate if NP has positive dimension.
cites work: Fractal dimension and logarithmic loss unpredictability.
cites work: Dimension, entropy rates, and compression
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
cites work: Q4359463
cites work: Dimension in Complexity Classes
cites work: The dimensions of individual strings and sequences
cites work: Effective fractal dimensions
cites work: A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
cites work: A Kolmogorov complexity characterization of constructive Hausdorff dimension.
cites work: Q5384978
cites work: Q3705346
cites work: Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
cites work: Kolmogorov complexity and Hausdorff dimension
cites work: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
DOI: 10.1007/S00224-012-9417-0
description: scientific article; zbMATH DE number 6153892