@inproceedings{472d351c53f34b37a2d4cc5700cc17a6,

title = "Almost complete sets",

abstract = "We show that there is a set which 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 A in a complexity class C is almost complete for C under some reducibility r if the class of the problems in C which do not r-reduce to A 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 one-one length-increasing reductions and truth-table reductions of norm 1 coincide with the almost p-m-complete sets for E. Moreover, we obtain similar results for the class EXP of sets computable in deterministic time 2poly.",

author = "Klaus Ambos-Spies and Wolfgang Merkle and Jan Reimann and Terwijn, {Sebastiaan A.}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000 ; Conference date: 17-02-2000 Through 19-02-2000",

year = "2000",

doi = "10.1007/3-540-46541-3_35",

language = "English (US)",

isbn = "9783540671411",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "419--430",

editor = "Horst Reichel and Sophie Tison",

booktitle = "STACS 2000 - 17th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2000, Proceedings",

address = "Germany",

}