Using Autoreducibility to Separate Complexity Classes

@inproceedings{Buhrman1995UsingAT,
  title={Using Autoreducibility to Separate Complexity Classes},
  author={Harry Buhrman and Lance Fortnow and Leen Torenvliet},
  booktitle={FOCS},
  year={1995}
}
A language is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate exponential space from doubly exponential space by showing that all Turing-complete sets for exponential space are autoreducible but there exists some Turing-complete set for doubly exponential space that is not. We immediately also get a separation of logarithmic space from polynomial space. Although we already know how to separate… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
24 Extracted Citations
2 Extracted References
Similar Papers

Referenced Papers

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

A comparison of polynomial time reducibilities

  • A. Selman
  • Journal of Symbolic Logic
  • 1973

Similar Papers

Loading similar papers…