Preliminary Version

@inproceedings{Lutz1994PreliminaryV,
  title={Preliminary Version},
  author={Jack H. Lutz},
  year={1994}
}
The main theorem of this paper is that, for every real number < 1 (e.g., = 0:99), only a measure 0 subset of the languages decidable in exponential time are Pn tt-reducible to languages that are not exponentially dense. Thus every Pn tt-hard language for E is exponentially dense. This strengthens Watanabe's 1987 result, that every PO(logn) tt-hard language for E is exponentially dense. The combinatorial technique used here, the sequentially most frequent query selection, also gives a new… CONTINUE READING