scientific article; zbMATH DE number 1335897
From MaRDI portal
Publication:4258588
zbMATH Open0935.68044MaRDI QIDQ4258588FDOQ4258588
Authors: Jack H. Lutz
Publication date: 4 May 2000
Title of this publication is not available (Why is that?)
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (19)
- Title not available (Why is that?)
- Measure on P: Robustness of the notion
- Effective fractal dimensions
- Axiomatizing resource bounds for measure
- A stronger Kolmogorov zero-one law for resource-bounded measure
- An outer-measure approach for resource-bounded measure
- A characterization of constructive dimension
- A Characterization of Constructive Dimension
- Scaled dimension and nonuniform complexity
- Computability versus exact computability of martingales
- Computational depth and reducibility
- Weakly complete problems are not rare
- Resource bound certification
- Compressibility and resource bounded measure
- Compressibility and resource bounded measure
- Logical Approaches to Computational Barriers
- An upward measure separation theorem
- Resource-bounded measure on probabilistic classes
- On Resource-Bounded Versions of the van Lambalgen Theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258588)