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 infinite subset in DEXP_TIME, thereby showing that these sets do not require the use of non-determinism almost everywhere. Furthermore, we show… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

The Complexity and Distribution of Hard Problems

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Weakly complete problems are not rare

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The complexity and distribution of hard problems

The quantitative structure of exponential time

  • Jack H. Lutz
  • Mathematics, Computer Science
  • [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
  • 1993