Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68376OpenAlexW2494705596MaRDI QIDQ5492899

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) 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)

Related Items (6)

Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable ⋮ Dimension, entropy rates, and compression ⋮ Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression ⋮ Pushdown dimension ⋮ Scaled dimension and the Kolmogorov complexity of Turing-hard sets ⋮ Dimension extractors and optimal decompression

This page was built for publication: Mathematical Foundations of Computer Science 2005