AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Computational Complexity Theory
About this Title
Juris Hartmanis, Editor
Publication: Proceedings of Symposia in Applied Mathematics
Publication Year:
1989; Volume 38
ISBNs: 978-0-8218-0131-4 (print); 978-0-8218-9253-4 (online)
DOI: https://doi.org/10.1090/psapm/038
Table of Contents
Download chapters as PDF
Front/Back Matter
Articles
- Juris Hartmanis – Overview of computational complexity theory [MR 1020807]
- Stephen R. Mahaney – The isomorphism conjecture and sparse sets [MR 1020808]
- Ronald V. Book – Restricted relativizations of complexity classes [MR 1020809]
- Neil Immerman – Descriptive and computational complexity [MR 1020810]
- Alan L. Selman – Complexity issues in cryptography [MR 1020811]
- Shafi Goldwasser – Interactive proof systems [MR 1020812]