scientific article; zbMATH DE number 1335897
From MaRDI portal
Publication:4258588
zbMath0935.68044MaRDI QIDQ4258588
Publication date: 4 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Effective fractal dimensions, Scaled dimension and nonuniform complexity, Computational depth and reducibility, Computability versus exact computability of martingales, An outer-measure approach for resource-bounded measure, Weakly complete problems are not rare, On Resource-Bounded Versions of the van Lambalgen Theorem, A Characterization of Constructive Dimension, A characterization of constructive dimension, Axiomatizing Resource Bounds for Measure, A stronger Kolmogorov zero-one law for resource-bounded measure