Computational complexity theory / [electronic resource] Juris Hartmanis, editor.
Material type:
TextSeries: Proceedings of symposia in applied mathematics ; v. 38. | Proceedings of symposia in applied mathematics. AMS short course lecture notes.Publication details: Providence, R.I. : American Mathematical Society, c1989.Description: 1 online resource (ix, 128 p.)ISBN: - 9780821892534 (online)
- 511.3 20
- QA267 .C592 1989
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK12305 |
Based on six lectures given at the AMS Short Course on Computational Complexity Theory in conjunction with the ninety-fourth annual meeting of the American Mathematical Society, Jan. 5-6, 1988.
Includes bibliographical references.
Overview of computational complexity theory / Juris Hartmanis -- The isomorphism conjecture and sparse sets / Stephen R. Mahaney -- Restricted relativizations of complexity classes / Ronald V. Book -- Descriptive and computational complexity / Neil Immerman -- Complexity issues in cryptography / Alan L. Selman -- Interactive proof systems / Shafi Goldwasser --
http://dx.doi.org/10.1090/psapm/038/1020807
http://dx.doi.org/10.1090/psapm/038/1020808
http://dx.doi.org/10.1090/psapm/038/1020809
http://dx.doi.org/10.1090/psapm/038/1020810
http://dx.doi.org/10.1090/psapm/038/1020811
http://dx.doi.org/10.1090/psapm/038/1020812
Access is restricted to licensed institutions
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
Mode of access : World Wide Web
Description based on print version record.
There are no comments on this title.