Measure on P: Robustness of the notion

DOI10.1007/3-540-60246-1_119MaRDI QIDQ3569004zbMATH OpenOpenAlexFDO

Authors Eric Allender, M. Strauss

Publication date 17 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60246-1_119

Mathematics Subject Classification ID

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

Recommendations

• A note on measuring in P
• Equivalence of Measures of Complexity Classes
• scientific article; zbMATH DE number 1335897
• Equivalence of measures of complexity classes
• Martingale families and dimension in P

Cited in

(8)

• Measure on P: Strength of the notion
• Resource bounded randomness and computational complexity
• Nondeterminisic sublinear time has measure 0 in P
• Sub-computable bounded pseudorandomness
• scientific article; zbMATH DE number 3596250 (Why is no real title available?)
• Robust Measures of Information
• Logical Approaches to Computational Barriers
• A note on measuring in P

This page was built for publication: Measure on P: Robustness of the notion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569004)