Honest polynomial-time degrees of elementary recursive sets

DOI10.1007/3-540-52753-2_29MaRDI QIDQ4268494zbMATH OpenFDO

Authors Klaus Ambos-Spies, Dongping Yang

Publication date 28 October 1999

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

Full work available at URL https://doi.org/10.1007/3-540-52753-2_29

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited in

(3)

• On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
• Undecidability results for low complexity time classes
• Resource-bounded martingales and computable Dowd-type generic sets

This page was built for publication: Honest polynomial-time degrees of elementary recursive sets

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