Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions

DOI10.1007/978-3-642-39206-1_40zbMath1336.68089MaRDI QIDQ5326584

Selman, Alan L., Christian Glaßer, Christian Reitwießner, Dung Tien Nguyen, Maximilian Witek

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39206-1_40

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D30: Other degrees and reducibilities in computability and recursion theory