External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

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]

Authors

Christian Glaßer

This author has not been identified. Look up 'Christian Glaßer' in Google

Dung T. Nguyen

This author has not been identified. Look up 'Dung T. Nguyen' in Google

Christian Reitwießner

This author has not been identified. Look up 'Christian Reitwießner' in Google

Alan L. Selman

This author has not been identified. Look up 'Alan L. Selman' in Google

Maximilian Witek

This author has not been identified. Look up 'Maximilian Witek' in Google
runs on