An overview of computational complexity

Author:
Stephen A. Cook

Univ. of Toronto, Toronto, Ont., Canada

Univ. of Toronto, Toronto, Ont., Canada
View Profile

Authors Info & Claims

Communications of the ACM Volume 26 Issue 6June 1983pp 400–408https://doi.org/10.1145/358141.358144

Published:01 June 1983Publication History

Get Citation Alerts

New Citation Alert added!

This alert has been successfully added and will be sent to:

You will be notified whenever a record that you have chosen has been cited.

To manage your alert preferences, click on the button below.
Manage my Alerts

New Citation Alert!

Please log in to your account
Publisher Site

eReader
PDF

Communications of the ACM

Abstract

An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed.

References

1 Adleman, L. Two theorems on random polynomial time. Proc. 19th IEEE Syrup. on Foundations of Computer Science. IEEE Computer Society, Los Angeles (1978), 75-83.Google ScholarDigital Library
2 Adleman, L., Pomerance, C., and Rumiey, R. S. On distinguishing prime numbers from composite numbers, Annals of Math 117, (January 1983), 173-206.Google ScholarCross Ref
3 Aho, A. V., Hopcroft, J. E. and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974. Google ScholarDigital Library
4 Bennett, J. H. On Spectra. Doctoral dissertation, Department of Mathematics, Princeton University, 1962.Google Scholar
5 Berlekamp, E. R. Factoring polynomials over large finite fields. Math. Comp. 24 (1970), 713-735.Google ScholarCross Ref
6 Blum, M. A machine independent theory of the complexity of recursive functions. JACM 14, 2 (April, 1967), 322-336. Google ScholarDigital Library
7 Blum, M., and Micali, S. How to generate cryptographically strong sequences of pseudo random bits. Proc. 23rd IEEE Syrup. on Foundations of Computer Science. IEEE Computer Society, Los Angeles. (1982), 112-117.Google ScholarDigital Library
8 Borodin, A. On relating time and space to size and depth. SIAM J. Comp. 6 (1977), 733-744.Google ScholarCross Ref
9 Borodin, A. Structured vs. general models in computational complexity. In Logic and Algorithmic Monographie no. 30 de L'Euseignement Mathematique Universite de Genuve, 1982.Google Scholar
10 Borodin, A. and Cook S. A time-space tradeoff for sorting on a general sequential model of computation. SLAM J. Comput. 11 (1982), 287-297.Google ScholarCross Ref
11 Borodin, A., van zur Gathen, I. and Hopcroft, J. Fast parallel matrix and GCD computations. 23rd IEEE Syrup. on Foundations of Computer Science. IEEE Computer Society, Los Angeles (1982), 65-71.Google Scholar
12 Borodin, A. and Munro, I. The Computational Complexity of Algebraic and Numeric Problems. Elsevier, New York, 1975.Google Scholar
13 Brockett, R. W. and Dobkin, D. On the optimal evaluation of a set of bilinear forms. Linear Algebra and its Applications 19 (1978), 207-235.Google ScholarCross Ref
14a Chaitin, G. J. On the length of programs for computing finite binary sequences. JACM 13, 4 (October 1966), 547-569; JACM 16, 1 (January 1969), 145-159. Google ScholarDigital Library
14b Chaitin, G. J. A theory of program size formally identical to informational theory. JACM 22, 3 0uly 1975), 329-340. Google ScholarDigital Library
15 Cobham, A. The intrinsic computational difficulty of functious. Proc. 1964 International Congress for Logic, Methodology, and Philosophy of Sciences. Y. Bar-Hellel, Ed,, North Holland, Amsterdam, 1965, 24-30.Google Scholar
16 Cobham, A. The recognition problem for the set of perfect squares. IEEE Conference Record Seventh SWAT. (1966), 78-87.Google ScholarDigital Library
17 Cohen, H. and Lenstra, H. W. Jr. Primarily testing and Jacobi sums. Report 82-18, University of Amsterdam, Dept. of Math., 1982.Google Scholar
18 Cook, S. A., The complexity of theorem proving procedures. Proc. 3rd ACM Syrup. on Theory of Computing. Shaker Heights, Ohio, (May 3-5, 1971), 151-158. Google ScholarDigital Library
19 Cook, S. A. Linear time simulation of deterministic two-way pushdown automata. Proc. IFIP Congress 71, (Theoretical Foundations). North Holland, Amsterdam, 1972, 7540.Google Scholar
20 Cook, S. A. An observation on time-storage tradeoff. JCSS 9 (1974), 308-316. Originally in Proc. 5th ACM Syrup. on Theory of Computing, Austin TX. (April 39-May 2 1973) 29-33. Google ScholarDigital Library
21 Cook, S. A. Towards a complexity, theory of synchronous parallel computation, L'Enseignement Mathdmatique XXVII (1981), 99-124.Google Scholar
22 Cook, S. A. and Aanderaa, S. O. On the minimum computation time of functions. Trans. AMS 142 (1969), 291-314.Google ScholarCross Ref
23 Cooley, J. M. and Tukey, J. W. An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19 (1965), 297-301.Google ScholarCross Ref
24 Coppersmith, D. and Winograd, S. On the asymptomatic complexity of matrix multiplication. SIAM J. Comp. 11 (1982), 472-492.Google ScholarCross Ref
25 Diffie, W. and Hellman, M. E. New directions in cryptography. IEEE Trans. on Inform. Theory IT-22 6 (1976), 644-54.Google ScholarDigital Library
26 Dobkin, D., Lipton, R. I. and Reiss, S. Linear programming is log-space hard for P. Inf. Processing Letters B (1979), 96-97.Google Scholar
27 Edmonds, J. Paths, trees, flowers. Conad. 1. Moth. 17 (1965), 449-67.Google Scholar
28 Edmonds, J. Minimum partition of a matroid into independent subsets. J. Res. Nat. Bur. Standards Sect. B, 69 (1965), 67-72.Google ScholarCross Ref
29 Ferrante, J. and Rackoff, C. W. The Computational Complexity of Logical Theories. Lecture Notes in Mathematics. #718, Springer Verlag, New York, 1979.Google Scholar
30 Fischer, M. J. and Rabin, M. O. Super-exponential complexity of Presburger arithmetic, In Complexity of Computation. SLAM-AMS Proc. 7, R. Karp, Ed., 1974, 27-42.Google Scholar
31 Garey, M. R. and Johnson, D. S. Computers and Intractability. A Guide to the Theory ofNP-Completeness. W. H. Freeman, San Francisco, 1979. Google ScholarDigital Library
32 Gill, J. Computational complexity of probabilistic Turing machines. SLAM J. Comput. 6 (1977), 675-4595.Google ScholarCross Ref
33 Goldschlager, L. M. Synchronous Parallel Computation. Doctoral dissertation, Dept. of Computer Science, Univ. of Toronto, 1977. See also JACM 29 4, (October 1982), 1073-1086. Google ScholarDigital Library
34 Goldschlager, L. M., Shaw, R. A. and Staples, J. The maximum flow problem is log space complete for P. Theoretical Computer Science 21 (1982), 105-111.Google ScholarCross Ref
35 Grzegorczyk, A. Some classes of recursive functions. Rozprawy Matematyczne, 1953.Google Scholar
36 Hartmanis, J. Observations about the development of theoretical computer science. Annals Hist. Comput. 3, 1 (Jan. 1981), 42-51.Google ScholarDigital Library
37 Hartmanis, J. and Stearns, R. E. On the computational complexity of algorithms. Trans. AMS 117 (1965), 285-306.Google ScholarCross Ref
38 Jones, N. D. and Laaser, W. T. Complete problems for deterministic polynomial time. Theoretical Computer Science 3 (1977), 105-117.Google ScholarCross Ref
39 Kaltofen, E. A polynomial reduction from multivariate to bivariate integer polynomial factorization. Pro(:. 14th ACM Symp. in Theory Comp. San Francisco, CA, (May 5-7 1982), 261-266. Google ScholarDigital Library
40 Kaltofen, E. A polynomial-time reduction from bivariate to univariate integral polynomial factorization. Preo. 23rd IEEE Symp. on Foundations of Computer Science. IEEE Computer Society, Los Angeles 1982, 57-64.Google ScholarDigital Library
41 Karatsuba, A. and Ofman, Yu. Multiplication of multidigit numbers on automata. Doklady Akad. Nauk 145, 2 (1962), 293-294. Translated in Soviet Phys. Doklady. 7 7 (1963), 595-596.Google Scholar
42 Karp, R. M. Reducibility among combinatorial problems. In: Complexity of Computer Computations. R. E. Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972, 85-104.Google Scholar
43 Khachian, L. G. A polynomial time algorithm for linear programming. Doklady Akad. Nauk SSSR. 244, 5 (1979), 1093-96. Translated in Soviet Math. Doklady. 20, 191-194.Google Scholar
44 Knuth, D. E. The Art of Computer Programming, vol. 3 Sorting and Searching, Addison-Wesley, Reading, MA. 1973. Google ScholarDigital Library
45 Kolmogorov, A. N. Three approaches to the concept of the amount of information. Probl. Pered. Inf. (Probl. of Inf Transm.) 1 (1965).Google Scholar
46 Kolmogorov, A. N. and Uspenski, V. A. On the definition of an algorithm, Uspehi Mat. Nauk. 13 (1958), 3-28; AMS Transl. 2nd sor. 29 (1963), 217- 245.Google Scholar
47 Ladner, R. E. The circuit value problem is log space complete for P. SIGACT News 71 (1975), 18-20. Google ScholarDigital Library
48 Lenstra, A. K., Lenstra, H. W. and Lovasz, L. Factoring polynomials with rational coefficients. Report 82-05, University of Amsterdam, Dept. of Math., 1982.Google ScholarCross Ref
49 Levin, L. A. Universal search problems. Problemy Peredaei Informacii 9 (1973), 115-116. Translated in Problems of Information Transmission 9, 265- 266.Google Scholar
50 Luks, E. M. Isomorphism of graphs of bounded valence can be tested in polynomial time. Prec. 21st IEEE Syrup. on Foundations of Computer Science. IEEE Computer Society, Los Angeles (1980), 42-49.Google Scholar
51 Meyer, A. R. Weak monadic second-order theory of successor is not elementary-recursive. Lecture Notes in Mathematics. #453, Springer Verlag, New York, 1975, 132-154.Google Scholar
52 Meyer, A. R. and Steokmeyer, L. J. The equivalence problem for regular expressions with squaring requires exponential space. Proc. 13th IEEE Symp. on Switching and Automata Theory. (1972), 125-129.Google ScholarDigital Library
53 Miller, G. L. Riemann's Hypothesis and tests for primality. J. Comput. System Sci. 13 (1976), 300-317.Google ScholarDigital Library
54 Oppen, D. C. A 222p" upper bound on the complexity of Presburger arithmetic. J. Comput. Syst. Sci. 16 (1978), 323-332.Google ScholarCross Ref
55 Papadimitriou, C. H. and Steiglitz, K. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982. Google ScholarDigital Library
56 Paterson, M. S., Fischer, M. J. and Meyer, A. R. An improved overlap argument for on-line multiplication. SLAM-AMS Proc. 7, Amer. Math. Soc., Providence, 1974. 97-111.Google Scholar
57a P(ppenger, N. On simultaneous resource bounds (preliminary version). Proc. 20th IEEE Syrup. on Foundations of Computer Science. IEEE Computer Society, Los Angeles (1979), 307-311.Google Scholar
57b Pippenger, N. J., and Fischer, M. J. Relations among complexity measures. JACM 26, 2 (April 1979), 361-381. Google ScholarDigital Library
58 Pratt, V. R. and Stockmeyer, L. J. A characterization of the power of vector machines. I. Comput. System Sci. 12 (1976), 198-221. Originally in Proc. 6th ACM Syrup. on Theory of Computing, Seattle, WA, (April 39-May 2, 1974), 122-134. Google ScholarDigital Library
59 Rabin, M. O. Speed of computation and classification of recursive sets. Third Convention SCi. Sac., Israel, 1959, 1-2.Google Scholar
60 Rabin, M. O. Degree of difificulty of computing a function and a partial ordering of recursive sets. Tech. Rep. No. 1, O.N.R., Jerusalem, 1960.Google Scholar
61 Rabin, M. O. Probabilistic algorithms. In Algorithms and Complexity, New Directions and Recent Trends, J. F. Traub, Ed., Academic Press, New York, 1976, 21-39.Google Scholar
62 Rabin, M. O. Complexity of Computations. Comm. ACM 20, 9 (September 1977), 625-633, Google ScholarDigital Library
63 Reff, J. H. Symmetric Complementation. Proc. 14th ACM Symp. on Theory of Computing, San Francisco, CA, (May 5-7, 1982), 201-214 Google ScholarDigital Library
64 Reisch, S. and Schnitger, G. Three applications of Kolmorgorov complexity. Proc. 23rd IEEE Symp. on Foundations of Computer Science. IEEE Computer Society, Los Angeles. 1982, 45-52.Google Scholar
65 Ritchie, R. W. Classes of Recursive Functions of Predictable Complexity. Doctoral Dissertation, Princeton University, 1960. Google ScholarDigital Library
66 Ritchie, R. W. Classes of predictably computable functions. Trans. AMS 106 (1963), 139-173.Google ScholarCross Ref
67a Rivest, R. L., Shamir, A. and Adleman, L. A method for obtaining digital signatures and public-key cryptesystems. Comm. ACM 21, 2 (February 1978), 120-126, Google ScholarDigital Library
67b Ruzzo, W.-L. On uniform circuit complexity. J. Comput. System SCi. 22 (1981), 365-383.Google ScholarCross Ref
68a Savage, J. E. The Complexity of Computing, Wiley', New York, 1976. Google ScholarDigital Library
68b Schnorr, C. P. The network complexity and the Turing machine complexity of finite functions. Acta Informatica 7 (1976), 95-107.Google ScholarDigital Library
69 Sch6nhage, A. Storage modification machines. SIAM I. Comp. 9 (1980), 490- 508.Google ScholarCross Ref
70 Schenhage, A. and Strassen, V. Schnelle Multiplication grosser Zahlen. Computing 7 (1971), 281-292.Google ScholarCross Ref
71 Schwartz, J. T. Probabilistic algorithms for verification of polynomial identities. IACM 27, 4 (October 1980), 701-717. Google ScholarDigital Library
72 Schwartz, J. T. Ultracomputers. ACM Trans. on Prog. Languages and Systems 2, 4 (October 1980), 484-521. Google ScholarDigital Library
73 Sliamir, A. On the generation of cryptographically strong pseudo random sequences. 8th Int. Colloquium on Automata, Languages, and Programming 0uly 1981), Lecture Notes in Computer Science No. 115, Springer Verlag, New York, 544-550. Google ScholarDigital Library
74 Shannon, C. E. The synthesis of two terminal switching circuits. BSTJ 28 (1949), 59-98.Google ScholarCross Ref
75 Smale, S. On the average speed of the simplex method of linear programruing. Preprint, 1982.Google Scholar
76 Smale, S. The problem of the average speed of the simplex method. Preprint, 1982.Google Scholar
77 Solovay, R. and Strassen, V. A fast monte-carlo test for primality. SLAM J. Comput. 6 (1977), 84--85.Google ScholarCross Ref
78 Stearns, R. E., Hartmanis, J. and Lewis P. M. II. Hierarchies of memory limited computations. 6th IEEE Syrup. on Switching Circuit Theory and LogicalDesign. (1965), 179-190.Google Scholar
79 Stockmeyer, L. J. The complexity of decision problems in automata theory and logic. Doctoral Thesis, Dept. of Electrical Eng., M1T, Cambridge, MA., 1974; Report TR-133, MIT Laboratory for Computer Science.Google Scholar
80 Stockmeyer, L. J. Classifying the computational complexity of problems. Research Report RC 7606 (1979), Math. Sciences Dept., IBM T. J. Watson Research Center, Yorktown Heights, N.Y.Google Scholar
81 Strassen, V. Ganssian elimination is not optimal Num. Math. 13 (1969), 354- 356.Google ScholarDigital Library
82 Strassen, V. Die Berechnungskomplexitfit von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten. Numer. Math. 20 (1973), 238-251.Google ScholarDigital Library
83 Baur, W. and Strassen, V. The complexity of partial derivatives. Preprint, 1982.Google Scholar
84 Toom, A. L. The complexity of a scheme of functional elements realizing the multiplication of integers. Doldady Akad. Nauk. SSSR 150 3, (1963) 496- 498. Translated in Soviet Math. Daklady 3 (1963), 714-716.Google Scholar
85 Turing, A. M. On computable numbers with an application to the Entscheidnungsproblem. Proc. London Math. SOc. ser. 2, 42 (1936-7), 230-265. A correction, ibid. 43 (1937), 544-546.Google Scholar
86 Valiant, L. G. The complexity of enumeration and reliability problems. SLAM J. Compat. 8 (1979), 410-421.Google ScholarCross Ref
87 Valiant, L. G. The complexity of computing the permanent. Theoretical Computer Science 8 (1979), 189-202.Google ScholarCross Ref
88 Valiant, L G. Parallel Computation. Proc. 7th IBM Japan Symp. Academic 6 Scientific Programs, IBM Japan, Tokyo (1982).Google Scholar
89 Valiant, L. G., Skyum, S., Berkowitz, S. and Rackoff, C. Fast parallel computation on polynomials using few processors. Preprint (Preliminary version in Springer Lecture Notes in Computer Science. 118 (1981), 132-139. Google ScholarDigital Library
90 van Neumarm, J. A certain zero-sum two-person game equivalent to the optimal assignment problem. Contributions to the Theory of Games 1I. H. W. Kahn and A. W. Tucker, Eds. Princeton Univ. Press, Princeton, NJ, 1953.Google Scholar
91 Yamada, H. Real time computation and recursive functions not real-time computable.LBE Transactions on Electronic Computers. EC-11 (1962), 753- 760.Google ScholarCross Ref
92 Yao, A. C. Theory and applications of trapdoor functions (Extended abstract). Proc. 23rd IEEE Syrup. on Foundations of Computer Science. lEVEE Computer Society, Los Angeles (1982), 80-91.Google Scholar

Index Terms

An overview of computational complexity
1. Theory of computation

Recommendations

An overview of computational complexity

ACM Turing award lectures

An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...

Read More
Evaluation and analysis of computational complexity for secure multicast models

ICCSA'03: Proceedings of the 2003 international conference on Computational science and its applications: PartII

Multicast is an internetwork service that provides efficient delivery of packets from a single source to multiple recipients. When there are large number of members in the group, security and scalability problems arise and an attempt to solve this, ...

Read More
Kolmogorov Complexity and Computational Complexity

Read More

Comments

comments powered by Disqus.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Published in
Communications of the ACM Volume 26, Issue 6

June 1983

54 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/358141

Editor:

Peter J. Denning
NASA Ames Research Center, Moffett Field, CA

Issue’s Table of Contents
Copyright © 1983 ACM

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
In-Cooperation
Publisher

Association for Computing Machinery

New York, NY, United States
Publication History
- Published: 1 June 1983
Permissions

Request permissions about this article.
Request Permissions

Check for updates
Author Tags
computational complexity
Qualifiers
- article
Conference
Funding Sources
Other Metrics

View Article Metrics

Article Metrics
- 114
  Total Citations
  View Citations
- 5,330
  Total Downloads
- Downloads (Last 12 months)174
- Downloads (Last 6 weeks)22
Other Metrics

View Author Metrics
Cited By
View all

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

An overview of computational complexity

Communications of the ACM

Abstract

References

Cited By

Index Terms

Recommendations

An overview of computational complexity

Evaluation and analysis of computational complexity for secure multicast models

Kolmogorov Complexity and Computational Complexity