An outer-measure approach for resource-bounded measure

DOI10.1007/S00224-007-9075-9zbMath1175.68183OpenAlexW2079672790MaRDI QIDQ841624

Jack Jie Dai

Publication date: 18 September 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9075-9

zbMATH Keywords

computational complexitymartingaleresource-bounded measureCarathéodory definition

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Axiomatizing Resource Bounds for Measure

Cites Work

• Almost everywhere high nonuniform complexity
• A stronger Kolmogorov zero-one law for resource-bounded measure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An outer-measure approach for resource-bounded measure