Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button below.
Copy To Clipboard
Successfully Copied!
Computational Complexity Theory
 
Edited by: Juris Hartmanis
Front Cover for Computational Complexity Theory
Available Formats:
Softcover ISBN: 978-0-8218-0131-4
Product Code: PSAPM/38
List Price: $57.00
MAA Member Price: $51.30
AMS Member Price: $45.60
Electronic ISBN: 978-0-8218-9253-4
Product Code: PSAPM/38.E
List Price: $53.00
MAA Member Price: $47.70
AMS Member Price: $42.40
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $85.50
MAA Member Price: $76.95
AMS Member Price: $68.40
Front Cover for Computational Complexity Theory
Click above image for expanded view
Computational Complexity Theory
Edited by: Juris Hartmanis
Available Formats:
Softcover ISBN:  978-0-8218-0131-4
Product Code:  PSAPM/38
List Price: $57.00
MAA Member Price: $51.30
AMS Member Price: $45.60
Electronic ISBN:  978-0-8218-9253-4
Product Code:  PSAPM/38.E
List Price: $53.00
MAA Member Price: $47.70
AMS Member Price: $42.40
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $85.50
MAA Member Price: $76.95
AMS Member Price: $68.40
  • Book Details
     
     
    Proceedings of Symposia in Applied Mathematics
    Volume: 381989; 128 pp
    MSC: Primary 68;

    Computational complexity theory is the study of the quantitative laws that govern computing. During the last 25 years, this field has grown into a rich mathematical theory. Currently one of the most active research areas in computer science, complexity theory is of considerable interest to mathematicians as well, since some of the key open problems in this field raise basic questions about the nature of mathematics. Many experts in complexity theory believe that, in coming decades, the strongest influence on the development of mathematics will come from the extended use of computing and from concepts and problems arising in computer science.

    This volume contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. The purpose of the short course was to provide an overview of complexity theory and to describe some of the current developments in the field. The papers presented here represent contributions by some of the top experts in this burgeoning area of research.

    Readership

  • Table of Contents
     
     
    • 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 ]
  • Request Review Copy
  • Get Permissions
Volume: 381989; 128 pp
MSC: Primary 68;

Computational complexity theory is the study of the quantitative laws that govern computing. During the last 25 years, this field has grown into a rich mathematical theory. Currently one of the most active research areas in computer science, complexity theory is of considerable interest to mathematicians as well, since some of the key open problems in this field raise basic questions about the nature of mathematics. Many experts in complexity theory believe that, in coming decades, the strongest influence on the development of mathematics will come from the extended use of computing and from concepts and problems arising in computer science.

This volume contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. The purpose of the short course was to provide an overview of complexity theory and to describe some of the current developments in the field. The papers presented here represent contributions by some of the top experts in this burgeoning area of research.

Readership

  • 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 ]
Please select which format for which you are requesting permissions.