Softcover ISBN:  9780821801314 
Product Code:  PSAPM/38 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
eBook ISBN:  9780821892534 
Product Code:  PSAPM/38.E 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
Softcover ISBN:  9780821801314 
eBook: ISBN:  9780821892534 
Product Code:  PSAPM/38.B 
List Price:  $224.00 $174.50 
MAA Member Price:  $201.60 $157.05 
AMS Member Price:  $179.20 $139.60 
Softcover ISBN:  9780821801314 
Product Code:  PSAPM/38 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
eBook ISBN:  9780821892534 
Product Code:  PSAPM/38.E 
List Price:  $99.00 
MAA Member Price:  $89.10 
AMS Member Price:  $79.20 
Softcover ISBN:  9780821801314 
eBook ISBN:  9780821892534 
Product Code:  PSAPM/38.B 
List Price:  $224.00 $174.50 
MAA Member Price:  $201.60 $157.05 
AMS Member Price:  $179.20 $139.60 

Book DetailsProceedings of Symposia in Applied MathematicsVolume: 38; 1989; 128 ppMSC: 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 ]


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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.

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 ]