Pushdown dimension
From MaRDI portal
Publication:995564
DOI10.1016/j.tcs.2007.04.005zbMath1188.68172arXivcs/0504047OpenAlexW2913798415MaRDI QIDQ995564
Publication date: 3 September 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0504047
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entropy rates and finite-state dimension
- Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups
- On encoding and decoding with two-way head machines
- Fractal dimension and logarithmic loss unpredictability.
- Prediction and dimension
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- MAX3SAT is exponentially hard to approximate if NP has positive dimension.
- Scaled dimension and nonuniform complexity
- Finite-state dimension
- The dimensions of individual strings and sequences
- Partial bi-immunity, scaled dimension, and NP-completeness
- A note on dimensions of polynomial size circuits
- Selection functions that do not preserve normality
- Endliche Automaten und Zufallsfolgen
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
- Two definitions of fractional dimension
- Compression of individual sequences via variable-rate coding
- Dimension in Complexity Classes
- The Construction of Decimals Normal in the Scale of Ten
- STACS 2004
- Online Learning and Resource‐Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Mathematical Foundations of Computer Science 2005
- Mathematical Foundations of Computer Science 2005
- Fundamentals of Computation Theory
- Dimension Characterizations of Complexity Classes
- Logical Approaches to Computational Barriers
This page was built for publication: Pushdown dimension
