scientific article; zbMATH DE number 2038717

MaRDI QIDQ4449182zbMATH OpenFDO

Authors John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo

Publication date 8 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190278.htm

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Scaled dimension and nonuniform complexity
• Dimension in Complexity Classes
• scientific article; zbMATH DE number 1346358
• Mathematical Foundations of Computer Science 2004
• Scaled dimension and the Kolmogorov complexity of Turing-hard sets

Cited in

(10)

• Scaled dimension and the Kolmogorov complexity of Turing-hard sets
• Resource-bounded strong dimension versus resource-bounded category
• Scaling and non-standard matching theorems
• Scaled dimension and nonuniform complexity
• A note on dimensions of polynomial size circuits
• Effective fractal dimensions
• Dimension in Complexity Classes
• Intrinsic Complexity and Scaling Laws: From Random Fields to Random Vectors
• Mathematical Foundations of Computer Science 2004
• Dimension, halfspaces, and the density of hard sets

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 Q4449182)