Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets

DOI10.1007/BFB0055796MaRDI QIDQ4218120zbMATH OpenFDO

Authors Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt

Publication date 2 March 1999

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

Full work available at URL https://doi.org/10.1007/BFB0055796

zbMATH Keywords

complexity classesdeterministic time classesdiagonalization strengthoraclerandom setsresource-bounded measure

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Resource bounded randomness and weakly complete problems
• An excursion to the Kolmogorov random strings
• scientific article; zbMATH DE number 1048036

Cited in

(5)

• Resource bounded randomness and weakly complete problems
• Almost complete sets.
• Hard sets are hard to find
• scientific article; zbMATH DE number 4131664 (Why is no real title available?)
• scientific article; zbMATH DE number 1929940 (Why is no real title available?)

This page was built for publication: Randomness vs. completeness: On the diagonalization strength of resource-bounded random sets

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