scientific article; zbMATH DE number 1500533

MaRDI QIDQ4501552zbMATH OpenFDO

Authors Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan A. Terwijn

Publication date 13 March 2001

zbMATH Keywords

almost complete setsresource-bounded measure

Mathematics Subject Classification ID

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

Recommendations

• Almost complete sets.
• scientific article; zbMATH DE number 1759402
• Hard sets are hard to find

Cited in

(8)

• Almost complete sets.
• Hard sets are hard to find
• Almost semirecursive sets
• scientific article; zbMATH DE number 4010508 (Why is no real title available?)
• scientific article; zbMATH DE number 1335891 (Why is no real title available?)
• Completeness and weak completeness under polynomial-size circuits
• Complete sets and closeness to complexity classes
• Constructions of complete sets

This page was built for publication:

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