Abstract
I can begin no more eloquently than by quoting the master himself:
The systematic study of computational complexity theory has developed into one of the central and most active research areas of computer science. It has grown into a rich and exciting mathematical theory whose development is motivated and guided by computer science needs and technological advances. At the same time, it is clear that complexity theory deals with the quantitative laws of computation and reasoning, is concerned with issues and problems of direct interest to many other disciplines as well. It is quite likely that in the overall impact of computer science on our thinking, complexity theory will be recognized as one of the most influential intellectual contributions.2
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Berman and H. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comput., 6: 305–322, 1977.
S. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symp. Theory of Computing, pages 151–158, 1971.
J. Hartmanis, editor. Computational Complexity Theory. Volume 38 of Procs. of Symposia in Applied Mathematics, Amer. Math. Society, 1989.
R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85–104, Plenum Press, New York, 1972.
R. Szelepcsényi. The method of forcing for nondeterministic space. In Bulletin of the EATCS, pages 96–99, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Selman, A.L. (1990). Introduction. In: Selman, A.L. (eds) Complexity Theory Retrospective. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4478-3_1
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4478-3_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8793-3
Online ISBN: 978-1-4612-4478-3
eBook Packages: Springer Book Archive