The following pages link to STACS 2004 (Q5309737):
Displaying 12 items.
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Entropy rates and finite-state dimension (Q817815) (← links)
- Constructive dimension equals Kolmogorov complexity (Q835015) (← links)
- Martingale families and dimension in P (Q930913) (← links)
- Pushdown dimension (Q995564) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Scaled dimension and nonuniform complexity (Q1880776) (← links)
- Dimensions of Copeland-Erdös sequences (Q2381501) (← links)
- The Kolmogorov complexity of infinite words (Q2383593) (← links)
- Generic density and small span theorem (Q2475804) (← links)
- A note on dimensions of polynomial size circuits (Q2503295) (← links)
- A Characterization of Constructive Dimension (Q4918047) (← links)
