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

From This Paper

Topics from this paper.
0 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Presidents, Parliaments and Policy

  • Haggard, Stephan, Mc Cubbins Mathew
  • American Political Science Review
  • 1993

Argentine Democracy: The Politics of Institutional Weakness

  • Murillo, Maria Victoria, Steven Levitsky Eds
  • British Journal of Political Science
  • 1990

Government Spending and Budget Deficits in the Industrial Countries.

  • N. Roubini, J. Sachs
  • Economic Policy
  • 1989
2 Excerpts

Le radici del frazionismo e il voto di preferenza

  • Pasquino, Gianfranco
  • Rivista Italiana di Scienza Politica
  • 1972

Similar Papers

Loading similar papers…