License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2014.590
URN: urn:nbn:de:0030-drops-44903
Go to the corresponding LIPIcs Volume Portal

Nguyen, Dung T. ; Selman, Alan L.

Non-autoreducible Sets for NEXP

48.pdf (0.6 MB)


We investigate autoreducibility properties of complete sets for NEXP under different polynomial-time reductions. Specifically, we show that under some polynomial-time reductions there are complete sets for NEXP that are not autoreducible.

We show that settling the question whether every complete set for NEXP under non-adaptative reduction is autoreducible under NOR-truth-table reduction either positively or negatively would lead to major results about the exponential time complexity classes.

BibTeX - Entry

  author =	{Dung T. Nguyen and Alan L. Selman},
  title =	{{Non-autoreducible Sets for NEXP}},
  booktitle =	{31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
  pages =	{590--601},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-65-1},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{25},
  editor =	{Ernst W. Mayr and Natacha Portier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-44903},
  doi =		{10.4230/LIPIcs.STACS.2014.590},
  annote =	{Keywords: Autoreducibility, NEXP, diagonalization, structural complexity}

Keywords: Autoreducibility, NEXP, diagonalization, structural complexity
Collection: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Issue Date: 2014
Date of publication: 05.03.2014

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI