Measure on P: Robustness of the notion

DOI10.1007/3-540-60246-1_119zbMath1193.68111OpenAlexW2143114850MaRDI QIDQ3569004

Martin J. Strauss, Eric W. Allender

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)

Related Items (5)

Sub-computable Bounded Pseudorandomness ⋮ Measure on \(P\): Strength of the notion ⋮ A note on measuring in P ⋮ Nondeterminisic sublinear time has measure 0 in P ⋮ Resource bounded randomness and computational complexity

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