Measure on P: Strength of the notion

DOI10.1006/INCO.1997.2639zbMATH Open0874.68175OpenAlexW2021781962MaRDI QIDQ1362904FDOQ1362904

Authors: M. Strauss 

Publication date: 10 November 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1997.2639

Recommendations

• Measure on P: Robustness of the notion
• A note on measuring in P
• Resource-bounded measure on probabilistic classes
• Logical Approaches to Computational Barriers
• Martingale families and dimension in P

zbMATH Keywords

resource-bounded measure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Almost everywhere high nonuniform complexity
• Title not available (Why is that?)
• Category and Measure in Complexity Classes
• Title not available (Why is that?)
• Computation times of NP sets of different densities
• Measure on P: Robustness of the notion
• P-Printable Sets

Cited In (8)

• Normal numbers and sources for BPP
• Axiomatizing resource bounds for measure
• Baire categories on small complexity classes and meager-comeager laws
• A note on measuring in P
• A zero-one SUBEXP-dimension law for BPP
• Nondeterminisic sublinear time has measure 0 in P
• Martingale families and dimension in P
• Resource-bounded measure on probabilistic classes

This page was built for publication: Measure on \(P\): Strength of the notion

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