scientific article; zbMATH DE number 1492083

zbMATH Open0945.03060MaRDI QIDQ4498396FDOQ4498396

Authors: Gunther Mainhardt 

Publication date: 16 August 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

stochasticityLebesgue measuregenericityrandomnessresource-bounded measurereducibilitiesrelativized complexity classescomplexity class Presource-bounded computationcomputable martingales

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Genericity, Randomness, and Polynomial-Time Approximations
• On pseudorandomness and resource-bounded measure
• Title not available (Why is that?)
• Resource bounded randomness and computational complexity
• Resource-bounded balanced genericity, stochasticity and weak randomness

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)