Computational complexity theory
Author(s)
Bibliographic Information
Computational complexity theory
（Proceedings of symposia in applied mathematics, v. 38）
American Mathematical Society, c1989
Available at / 39 libraries
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science図書
DC19:511.3/H2552070123772
-
No Libraries matched.
- Remove all filters.
Note
"Lecture notes prepared for the American Mathematical Society Short Course Computational Complexity Theory, held in Atlanta, Georgia, January 5-6, 1988"--T.p. verso
"AMS Short Course on Computational Complexity Theory in conjunction with the Ninety-fourth Annual Meeting of the Society on January 5-6, 1988"--Pref.
Includes bibliographies
Description and Table of Contents
Description
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
Overview of computational complexity theory by J. Hartmanis The isomorphism conjecture and sparse sets by S. R. Mahaney Restricted relativizations of complexity classes by R. V. Book Descriptive and computational complexity by N. Immerman Complexity issues in cryptography by A. L. Selman Interactive proof systems by S. Goldwasser.
by "Nielsen BookData"