A comparison of polynomial time completeness notions
Theoretical Computer Science
Structural complexity 1
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
On 1-truth-table-hard languages
Theoretical Computer Science
Theoretical Computer Science
The Complexity and Distribution of Hard Problems
SIAM Journal on Computing
Almost every set in exponential time is P-bi-immune
Theoretical Computer Science
SIAM Journal on Computing
Genericity and measure for exponential time
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Resource bounded randomness and weakly complete problems
Theoretical Computer Science
The quantitative structure of exponential time
Complexity theory retrospective II
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A Comparison of Weak Completeness Notions
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Pseudorandom generators, measure theory, and natural proofs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
Measure on small complexity classes, with applications for BPP
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.03 |
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.