scientific article; zbMATH DE number 1500533

zbMATH Open0956.03038MaRDI QIDQ4501552FDOQ4501552

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

Publication date: 13 March 2001

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

resource-bounded measurealmost complete sets

Mathematics Subject Classification ID

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

Cited In (7)

• Almost semirecursive sets
• Title not available (Why is that?)
• Completeness and weak completeness under polynomial-size circuits
• Constructions of complete sets
• Almost complete sets.
• Complete sets and closeness to complexity classes
• Hard sets are hard to find

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)