Resource-bounded measure on probabilistic classes

DOI10.1016/J.IPL.2007.11.019zbMath1186.68206OpenAlexW2006533881MaRDI QIDQ963376

Philippe Moser

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://eprints.maynoothuniversity.ie/3501/1/PM_Measure.pdf

zbMATH Keywords

computational complexityrandomized algorithmsprobabilistic complexity classesresource-bounded measure

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Martingale families and dimension in P ⋮ Axiomatizing Resource Bounds for Measure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost everywhere high nonuniform complexity
• Measure on \(P\): Strength of the notion
• Baire categories on small complexity classes and meager-comeager laws
• Category and Measure in Complexity Classes
• Logical Approaches to Computational Barriers
• Natural proofs

This page was built for publication: Resource-bounded measure on probabilistic classes