On the structure of complete sets: Almost everywhere complexity and infinitely often speedup

@article{Berman1976OnTS,
  title={On the structure of complete sets: Almost everywhere complexity and infinitely often speedup},
  author={Leonard Berman},
  journal={17th Annual Symposium on Foundations of Computer Science (sfcs 1976)},
  year={1976},
  pages={76-80}
}
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… CONTINUE READING