×

Found 4 Documents (Results 1–4)

Introduction to autoreducibility and mitoticity. (English) Zbl 1376.03042

Day, Adam (ed.) et al., Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-50061-4/pbk; 978-3-319-50062-1/ebook). Lecture Notes in Computer Science 10010, 56-78 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Non-autoreducible sets for NEXP. (English) Zbl 1359.68098

Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 590-601 (2014).
MSC:  68Q15
PDFBibTeX XMLCite
Full Text: DOI

Autoreducibility of complete sets for log-space and polynomial-time reductions. (English) Zbl 1336.68089

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 473-484 (2013).
MSC:  68Q15 03D15 03D30
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field