STACS 2004
From MaRDI portal
Publication:5309737
DOI10.1007/B96012zbMath1122.68068OpenAlexW4236485840MaRDI QIDQ5309737
Elvira Mayordomo, John M. Hitchcock, Jack H. Lutz, Krishna B. Athreya
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Fractals (28A80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Theory of numerations, effectively presented structures (03D45)
Related Items (13)
Scaled dimension and nonuniform complexity ⋮ Constructive dimension equals Kolmogorov complexity ⋮ Dimensions of Copeland-Erdös sequences ⋮ The Kolmogorov complexity of infinite words ⋮ Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension ⋮ Martingale families and dimension in P ⋮ Generic density and small span theorem ⋮ A Characterization of Constructive Dimension ⋮ A note on dimensions of polynomial size circuits ⋮ Pushdown dimension ⋮ A characterization of constructive dimension ⋮ Dimension extractors and optimal decompression ⋮ Entropy rates and finite-state dimension
This page was built for publication: STACS 2004
