- About MAA
- Membership
- MAA Publications
- Periodicals
- Blogs
- MAA Book Series
- MAA Press (an imprint of the AMS)
- MAA Notes
- MAA Reviews
- Mathematical Communication
- Information for Libraries
- Author Resources
- Advertise with MAA
- Meetings
- Competitions
- Programs
- Communities
- MAA Sections
- SIGMAA
- MAA Connect
- Students
- MAA Awards
- Awards Booklets
- Writing Awards
- Teaching Awards
- Service Awards
- Research Awards
- Lecture Awards
- Putnam Competition Individual and Team Winners
- D. E. Shaw Group AMC 8 Awards & Certificates
- Maryam Mirzakhani AMC 10 A Awards & Certificates
- Two Sigma AMC 10 B Awards & Certificates
- Jane Street AMC 12 A Awards & Certificates
- Akamai AMC 12 B Awards & Certificates
- High School Teachers
- News
You are here
Computational Complexity Theory
Publisher:
American Mathematical Society
Publication Date:
1989
Number of Pages:
128
Format:
Hardcover
Series:
Proceedings of Symposia in Applied Mathematics
Price:
46.00
ISBN:
978-0821801314
Category:
Textbook
The Basic Library List Committee recommends this book for acquisition by undergraduate mathematics libraries.
There is no review yet. Please check back later.
- J. Hartmanis -- Overview of computational complexity theory
- S. R. Mahaney -- The isomorphism conjecture and sparse sets
- R. V. Book -- Restricted relativizations of complexity classes
- N. Immerman -- Descriptive and computational complexity
- A. L. Selman -- Complexity issues in cryptography
- S. Goldwasser -- Interactive proof systems
- Log in to post comments
