Resource-bounded measure on probabilistic classes
From MaRDI portal
Publication:963376
DOI10.1016/J.IPL.2007.11.019zbMATH Open1186.68206OpenAlexW2006533881MaRDI QIDQ963376FDOQ963376
Authors: 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
Recommendations
computational complexityrandomized algorithmsresource-bounded measureprobabilistic complexity classes
Cites Work
- Title not available (Why is that?)
- Almost everywhere high nonuniform complexity
- Category and Measure in Complexity Classes
- Title not available (Why is that?)
- Natural proofs
- Measure on \(P\): Strength of the notion
- Logical Approaches to Computational Barriers
- Baire categories on small complexity classes and meager-comeager laws
- Title not available (Why is that?)
Cited In (12)
- Title not available (Why is that?)
- Axiomatizing resource bounds for measure
- A stronger Kolmogorov zero-one law for resource-bounded measure
- An outer-measure approach for resource-bounded measure
- Upward separations and weaker hypotheses in resource-bounded measure
- A note on measuring in P
- Resource bounded randomness and computational complexity
- Uncountable realtime probabilistic classes
- Operational characterization of weight-based resource quantifiers via exclusion tasks in general probabilistic theories
- An upward measure separation theorem
- A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
- Martingale families and dimension in P
This page was built for publication: Resource-bounded measure on probabilistic classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963376)
