scientific article; zbMATH DE number 1492083

MaRDI QIDQ4498396zbMATH OpenFDO

Authors Gunther Mainhardt

Publication date 16 August 2000

zbMATH Keywords

complexity class Pcomputable martingalesgenericityLebesgue measurerandomnessreducibilitiesrelativized complexity classesresource-bounded computationresource-bounded measurestochasticity

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 1008512
• Genericity and randomness over feasible probability measures
• Resource-bounded balanced genericity, stochasticity and weak randomness
• scientific article; zbMATH DE number 1048036
• scientific article; zbMATH DE number 1335897

Cited in

(9)

• Genericity and randomness over feasible probability measures
• Resource bounded randomness and computational complexity
• Genericity, Randomness, and Polynomial-Time Approximations
• scientific article; zbMATH DE number 1008512 (Why is no real title available?)
• scientific article; zbMATH DE number 1104167 (Why is no real title available?)
• Resource-bounded balanced genericity, stochasticity and weak randomness
• scientific article; zbMATH DE number 1860654 (Why is no real title available?)
• scientific article; zbMATH DE number 841081 (Why is no real title available?)
• On pseudorandomness and resource-bounded measure

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