Strong Reductions and Immunity for Exponential Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Separating NP-Completeness Notions Under Strong Hypotheses
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
P-Selectivity, immunity, and the power of one bit
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Nontriviality for exponential time w.r.t weak reducibilities
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Characterizations and Existence of Easy Sets without Hard Subsets
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Nontriviality for exponential time w.r.t. weak reducibilities
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we investigate the structure of sets which are complete for various classes. We show, for example, that sets complete for deterministic time classes contain infinite polynomial time recognizable subsets, thus showing that they are not complex almost everywhere. We show by a related technique that any set complete for NEXP_TIME contains an infinite subset in DEXP_TIME, thereby showing that these sets do not require the use of non-determinism almost everywhere. Furthermore, we show that complete sets for deterministic time classes have effective I.O. speed-up to a polynomial; this strengthens a result of Stockmeyer.