Christian Glaßer, Dung T. Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek. Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. In Fedor V. Fomin, Rusins Freivalds, Marta Z. Kwiatkowska, David Peleg, editors, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Volume 7965 of Lecture Notes in Computer Science, pages 473-484, Springer, 2013. [doi]
@inproceedings{GlasserNRSW13, title = {Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions}, author = {Christian Glaßer and Dung T. Nguyen and Christian Reitwießner and Alan L. Selman and Maximilian Witek}, year = {2013}, doi = {10.1007/978-3-642-39206-1_40}, url = {http://dx.doi.org/10.1007/978-3-642-39206-1_40}, researchr = {https://researchr.org/publication/GlasserNRSW13}, cites = {0}, citedby = {0}, pages = {473-484}, booktitle = {Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I}, editor = {Fedor V. Fomin and Rusins Freivalds and Marta Z. Kwiatkowska and David Peleg}, volume = {7965}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-39205-4}, }