You are here

Computational Complexity Theory

Juris Hartmanis, editor
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
BLL Rating: 

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
Tags: 

Dummy View - NOT TO BE DELETED