Mathematical Foundations of Computer Science 2005
DOI10.1007/11549345zbMATH Open1156.68376OpenAlexW2494705596MaRDI QIDQ5492899FDOQ5492899
Authors: María López-Valdés, Elvira Mayordomo 
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Recommendations
- Dimension is compression
- Dimension, entropy rates, and compression
- Lempel-Ziv Dimension for Lempel-Ziv Compression
- Planar diameter via metric compression
- Tension is dimension
- Metric Mean Dimension and Analog Compression
- Pushdown dimension
- Dimension versus size
- scientific article; zbMATH DE number 4213810
- Dimension in diffeology
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (10)
- Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
- Pushdown dimension
- Structure coarsening, entropy and compressed space dimension
- Dimension extractors and optimal decompression
- Scaled dimension and the Kolmogorov complexity of Turing-hard sets
- On the optimal compression of sets in PSPACE
- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
- Dimension is compression
- Base invariance of feasible dimension
- Dimension, entropy rates, and compression
This page was built for publication: Mathematical Foundations of Computer Science 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492899)
