Almost Complete Sets

We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin . Here a set in a complexity class C is almost complete for C under some given reducibility if the class of the problems in C that do not reduce to this set has measure 0 in C in the sense of Lutz's resource-bounded measure theory. We also show that the almost complete sets for E under polynomial time-bounded length-increasing one

• Type: Conference
• Year: 2000
• Where: STACS
• Authors: Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
• Keywords: Deterministic Time, Lutz's Resource-bounded Measure, Reductions, STACS 2000, Theoretical Computer Science