@InProceedings{nguyen_et_al:LIPIcs.STACS.2014.590,
  author =	{Nguyen, Dung T. and Selman, Alan L.},
  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 =	{Mayr, Ernst W. and Portier, Natacha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.590},
  URN =		{urn:nbn:de:0030-drops-44903},
  doi =		{10.4230/LIPIcs.STACS.2014.590},
  annote =	{Keywords: Autoreducibility, NEXP, diagonalization, structural complexity}
}