Computational Complexity Theory
About this Title
Juris Hartmanis, Editor
Publication: Proceedings of Symposia in Applied Mathematics
Publication Year: 1989; Volume 38
ISBNs: 978-0-8218-0131-4 (print); 978-0-8218-9253-4 (online)
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.
Table of Contents
- 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]