Hostname: page-component-78c5997874-v9fdk Total loading time: 0 Render date: 2024-11-11T05:42:12.862Z Has data issue: false hasContentIssue false
  • English
  • Français

Classifying the computational complexity of problems

Published online by Cambridge University Press:  12 March 2014

Larry Stockmeyer
Larry Stockmeyer*
Affiliation:
IBM Almaden Research Center, San Jose, California 95120
Get access Rights & Permissions [Opens in a new window]

Extract

One of the more significant achievements of twentieth century mathematics, especially from the viewpoints of logic and computer science, was the work of Church, Gödel and Turing in the 1930's which provided a precise and robust definition of what it means for a problem to be computationally solvable, or decidable, and which showed that there are undecidable problems which arise naturally in logic and computer science. Indeed, when one is faced with a new computational problem, one of the first questions to be answered is whether the problem is decidable or undecidable. A problem is usually defined to be decidable if and only if it can be solved by some Turing machine, and the class of decidable problems defined in this way remains unchanged if “Turing machine” is replaced by any of a variety of other formal models of computation. The division of all problems into two classes, decidable or undecidable, is very coarse, and refinements have been made on both sides of the boundary. On the undecidable side, work in recursive function theory, using tools such as effective reducibility, has exposed much additional structure such as degrees of unsolvability. The main purpose of this survey article is to describe a branch of computational complexity theory which attempts to expose more structure within the decidable side of the boundary.

Motivated in part by practical considerations, the additional structure is obtained by placing upper bounds on the amounts of computational resources which are needed to solve the problem. Two common measures of the computational resources used by an algorithm are time, the number of steps executed by the algorithm, and space, the amount of memory used by the algorithm.

Type
Survey/expository paper
Information
The Journal of Symbolic Logic , Volume 52 , Issue 1 , March 1987 , pp. 1 - 43
Copyright
Copyright © Association for Symbolic Logic 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[AHU] Aho, A. V., Hopcroft, J. E., and Ullman, J. D., The design and analysis of computer algorithms, Addison-Wesley, Reading, Massachusetts, 1974.Google Scholar
[Amb] Ambos-Spies, K., Three theorems on polynomial degrees of NP-sets, Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (1985), pp. 51–55.Google Scholar
[As] Asser, G., Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 1 (1955), pp. 252–263.CrossRefGoogle Scholar
[Ba] Babai, L., Trading group theory for randomness, Proceedings of the 17th ACM Symposium on Theory of Computing (1985), pp. 421–429.Google Scholar
[BaGS] Baker, T., Gill, J., and Solovay, R., Relativizations of the P = ? NP question, SIAM Journal on Computing, vol. 4 (1975), pp. 431–442.CrossRefGoogle Scholar
[BeKR] Ben-Or, M., Kozen, D., and Reif, J., The complexity of elementary algebra and geometry, Journal of Computer and System Sciences, vol. 32 (1986), pp. 251–264.CrossRefGoogle Scholar
[BeG] Bennett, C. H. and Gill, J., Relative to a random oracle A, PA # NPA # co-NPA with probability 1, SIAM Journal on Computing, vol. 10 (1981), pp. 96–113.CrossRefGoogle Scholar
[Berl] Berlekamp, E. R., Factoring polynomials over large finite fields, Mathematics of Computation, vol. 24 (1970), pp. 713–735.CrossRefGoogle Scholar
[Ber1] Berman, L., On the structure of complete sets: almost everywhere complexity and infinitely often speedup, Proceedings of the 17th IEEE Symposium on Foundations of Computer Science (1976), 76–80.Google Scholar
[Ber2] Berman, L., The complexity of logical theories, Theoretical Computer Science, vol. 11 (1980), pp. 71–77.CrossRefGoogle Scholar
[BerH] Berman, L. and Hartmanis, J., On isomorphisms and density of NP and other complete sets, SIAM Journal on Computing, vol. 6 (1977), pp. 305–322.CrossRefGoogle Scholar
[Blu1] Blum, M., A machine independent theory of the complexity of recursive functions, Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336.CrossRefGoogle Scholar
[Blu2] Blum, M., On effective procedures for speeding up algorithms, Journal of the Association for Computing Machinery, vol. 18 (1971), pp. 290–305.CrossRefGoogle Scholar
[Blu3] Blum, N., A note on the parallel computation thesis, Information Processing Letters, vol. 17 (1983), pp. 203–205.CrossRefGoogle Scholar
[Bo] Book, R. V., Translational lemmas, polynomial time, and (log n) j -space , Theoretical Computer Science, vol. 1 (1976), pp. 215–226.CrossRefGoogle Scholar
[Borg] Börger, E., Spektralproblem and completeness of logical decision problems, Logic and machines: decision problems and complexity, Lecture Notes in Computer Science, vol. 171, Springer-Verlag, New York, 1984, pp. 333–356.CrossRefGoogle Scholar
[Boro] Borodin, A., On relating time and space to size and depth, SIAM Journal on Computing, vol. 6 (1977), pp. 733–744.CrossRefGoogle Scholar
[BrM] Bruss, A. R. and Meyer, A. R., On time-space classes and their relation to the theory of real addition. Theoretical Computer Science, vol. 11 (1980), pp. 59–69.CrossRefGoogle Scholar
[Bu] Büchi, J. R., Weak second order arithmetic and finite automata, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 66–92.CrossRefGoogle Scholar
[ChH] Chandra, A. K. and Harel, D., Structure and complexity of relational queries, Journal of Computer and System Sciences, vol. 25 (1982), pp. 99–128.CrossRefGoogle Scholar
[ChKS] Chandra, A. K., Kozen, D. C., and Stockmeyer, L. J., Alternation, Journal of the Association for Computing Machinery, vol. 28 (1981), pp. 114–133.CrossRefGoogle Scholar
[ChS] Chandra, A. K. and Stockmeyer, L. J., Alternation, Proceedings of the 17th IEEE Symposium on Foundations of Computer Science (1976), pp. 98–108.Google Scholar
[Cob] Cobham, A., The intrinsic computational difficulty of functions, Proceedings of the 1964 international congress for logic, methodology and philosophy of science (Bar-Hillel, Y., editor), North-Holland, Amsterdam, 1965, pp. 24–30.Google Scholar
[Col] Collins, G. E., Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Second GI conference on automata theory and format languages, Lecture Notes in Computer Science, vol. 33, Springer-Verlag, New York, 1975, pp. 134–183.Google Scholar
[CoH] Compton, K. and Henson, C. W., A new method for proving lower bounds on the computational complexity of first-order theories, manuscript in preparation. 1984.Google Scholar
[CoL] Condon, A. and Ladner, R., Probabilistic game automata, Proceedings of the structure in complexity theory conference (Berkeley, California, 1986), Lecture Notes in Computer Science, vol. 223, Springer-Verlag, New York, 1986, pp. 144–162.CrossRefGoogle Scholar
[Co1] Cook, S. A., The complexity of theorem proving procedures, Proceedings of the 3rd ACM Symposium on Theory of Computing (1971), pp. 151–158.Google Scholar
[Co2] Cook, S. A., A hierarchy for nondeterministic time complexity, Journal of Computer and System Sciences, vol. 7 (1973), pp. 343–353.CrossRefGoogle Scholar
[Co3] Cook, S. A., An observation on time-storage trade off, Journal of Computer and System Sciences, vol. 9 (1974), pp. 308–316.CrossRefGoogle Scholar
[Co4] Cook, S. A., Towards a complexity theory of synchronous parallel computation, L'Enseignement Mathématique, vol. 27 (1981), pp. 99–124; also, Technical Report #141/80, Department of Computer Science, University of Toronto, 1980.Google Scholar
[Co5] Cook, S. A., A taxonomy of problems with fast parallel algorithms, Information and Control, vol. 64 (1985), pp. 2–22.CrossRefGoogle Scholar
[Co6] Cook, S. A., An overview of computational complexity, Communications of the ACM, vol. 26 (1983), pp. 400–408.CrossRefGoogle Scholar
[CoR] Cook, S. A. and Reckhow, R. A., Time bounded random access machines, Journal of Computer and System Sciences, vol. 7 (1973), pp. 354–375.CrossRefGoogle Scholar
[Cs] Csanky, L., Fast parallel matrix inversion algorithms, SIAM Journal on Computing, vol. 5 (1976), pp. 618–623.CrossRefGoogle Scholar
[Dav] Davis, M., The undecidable, Raven Press, Hewlett, New York, 1965.Google Scholar
[Dek] Dekhtiar, M., On the impossibility of eliminating complete enumeration in computing a function relative to its graph, Doklady Akademii Nauk SSSR, vol. 189 (1969), pp. 748–751 (in Russian); English translation, Soviet Physics Doklady , vol. 14 (1969/70), pp. 1146–1148.Google Scholar
[DoLR] Dobkin, D., Lipton, R. J., and Reiss, S., Linear programming is log-space hard for P , Information Processing Letters, vol. 8 (1979), pp. 96–97.CrossRefGoogle Scholar
[DKM] Dwork, C., Kanellakis, P. C., and Mitchell, J. C., On the sequential nature of unification, Journal of Logic Programming, vol. 1 (1984), pp. 35–50.CrossRefGoogle Scholar
[Edm] Edmonds, J., Paths, trees and flowers, Canadian Journal of Mathematics, vol. 17 (1965), pp. 449–467.CrossRefGoogle Scholar
[Ehr] Ehrenfeucht, A., Practical decidability, Journal of Computer and System Sciences, vol. 11 (1975), pp. 392–396.CrossRefGoogle Scholar
[Elg] Elgot, C. C., Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society, vol. 98 (1961) pp. 21–51.CrossRefGoogle Scholar
[EvSY] Even, S., Selman, A. L., and Yacobi, Y., Hard-core theorems for complexity classes, Journal of the Association for Computing Machinery, vol. 32 (1985), pp. 205–217.CrossRefGoogle Scholar
[Fa] Fagin, R., Generalized first-order spectra and polynomial-time recognizable sets, Complexity of computation (Karp, R., editor), SIAM-AMS Proceedings, vol. 7, American Mathematical Society, Providence, Rhode Island, 1974, pp. 43–73.Google Scholar
[Fe] Ferrante, J., Some upper and lower bounds on decision procedures in logic, Doctoral Thesis, Department of Mathematics, M.I.T., Cambridge, Massachusetts, 1974; also Report TR-139, M.I.T. Laboratory for Computer Science.Google Scholar
[FeR1] Ferrante, J. and Rackoff, C., A decision procedure for the first-order theory of real addition with order, SIAM Journal on Computing, vol. 4 (1975), pp. 69–76.CrossRefGoogle Scholar
[FeR2] Ferrante, J. and Rackoff, C., The computational complexity of logical theories, Lecture Notes in Mathematics, vol. 718, Springer-Verlag, New York, 1979.CrossRefGoogle Scholar
[FiL] Fischer, M. J. and Ladner, R. E., Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol. 18 (1979), pp. 194–211.CrossRefGoogle Scholar
[FiR] Fischer, M. J. and Rabin, M. O., Super-exponential complexity of Preshurger arithmetic, Complexity of computation (Karp, R., editor), SIAM-AMS Proceedings, vol. 7, American Mathematical Society, Providence, Rhode Island, 1974, pp. 27–42.Google Scholar
[FoW] Fortune, S. and Wyllie, J., Parallelism in random access machines, Proceedings of the 10th ACM Symposium on Theory of Computing (1978), pp. 114–118.Google Scholar
[FrL] Fraenkel, A. S. and Lichtenstein, D., Computing a perfect strategy for n × n chess requires time exponential in n, Journal of Combinatorial Theory A, vol. 31 (1981), pp. 199–214.CrossRefGoogle Scholar
[Fu1] Fürer, M., Nicht-elementare untere Schranken in der Automaten-theorie, Doctoral Thesis, ETH, Zürich, 1978.Google Scholar
[Fu2] Fürer, M., The complexity of Preshurger arithmetic with hounded quantifier alternation depth, Theoretical Computer Science, vol. 18 (1982), pp. 105–111.CrossRefGoogle Scholar
[FuSS] Fürst, M., Saxe, J. B., and Sipser, M., Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory, vol. 17 (1984), pp. 13–27.CrossRefGoogle Scholar
[GaJ] Garey, M. R. and Johnson, D. S., Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco, California, 1979.Google Scholar
[Gi] Gill, J., Computational complexity of probabilistic Turing machines, SIAM Journal on Computing, vol. 6 (1977), pp. 675–695.CrossRefGoogle Scholar
[Go1] Goldschlager, L. M., The monotone and planar circuit value problems are log space complete for P, SIGACT News, vol. 9 (1977), no. 2, pp. 25–29.CrossRefGoogle Scholar
[Go2] Goldschlager, L. M., A universal interconnection pattern for parallel computers, Journal of the Association for Computing Machinery, vol. 29 (1982), pp. 1073–1086.CrossRefGoogle Scholar
[GoSS] Goldschlager, L. M., Shaw, R. A., and Staples, J., The maximum flow problem is log space complete for P, Theoretical Computer Science, vol. 21 (1982), pp. 105–111.CrossRefGoogle Scholar
[GoSi] Goldwasser, S. and Sipser, M., Private coins versus public coins in interactive proof systems, Proceedings of the 18th ACM Symposium on Theory of Computing (1986), pp. 59–68.Google Scholar
[Gu1] Gurevich, Y., Algebras of feasible functions, Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (1983), pp. 210–214.Google Scholar
[Gu2] Gurevich, Y., Toward logic tailored for computational complexity, Computation and proof theory (Richter, M. M. et. al., editors), Lecture Notes in Mathematics, vol. 1104, Springer-Verlag, New York, 1984, pp. 175–216.CrossRefGoogle Scholar
[Gu3] Gurevich, Y., Logic and the challenge of computer science, Report CRL-TR-10-85, Computing Research Laboratory, University of Michigan, Ann Arbor, Michigan, 1985.Google Scholar
[Hac] Hack, M., The equality problem for vector addition systems is undecidable, Theoretical Computer Science, vol. 2 (1976), pp. 77–96.CrossRefGoogle Scholar
[HalM] Halpern, J. Y. and Moses, Y., A guide to the modal logics of knowledge and belief, Proceedings of the international joint conference on artificial intelligence (1985), American Association for Artificial Intelligence, Menlo Park, California, 1985, pp. 480–490.Google Scholar
[HalR] Halpern, J. Y. and Reif, J., The propositional dynamic logic of deterministic well-structured programs, Theoretical Computer Science, vol. 27 (1983), pp. 127–165.CrossRefGoogle Scholar
[HalV] Halpern, J. Y. and Vardi, M., The complexity of reasoning about knowledge and time, Proceedings of the 18th ACM Symposium on Theory of Computing (1986), pp. 304–315.Google Scholar
[Har] Hartmanis, J., Observations about the development of theoretical computer science, Annals of the History of Computing, vol. 3 (1981), pp. 42–51.CrossRefGoogle Scholar
[HarM] Hartmanis, J. and Mahaney, S. R., An essay about research on sparse complete sets, Proceedings of the 9th symposium on mathematical foundations of computer science (1980), Lecture Notes in Computer Science, vol. 88, Springer-Verlag, New York, pp. 40–57.Google Scholar
[HarS] Hartmanis, J. and Stearns, R. E., On the computational complexity of algorithms, Transactions of the American Mathematical Society, vol. 117 (1965), pp. 285–306.CrossRefGoogle Scholar
[Has] Hastad, J., Almost optimal lower bounds for small depth circuits, Proceedings of the 18th ACM Symposium on Theory of Computing (1986), pp. 6–20.Google Scholar
[HooR] Hoover, H. J. and Ruzzo, W. L., A compendium of problems complete for P, Technical Report, Department of Computer Science, University of Washington, Seattle, Washington (to appear).Google Scholar
[HoPV] Hopcroft, J., Paul, W., and Valiant, L., On time versus space, Journal of the Association for Computing Machinery, vol. 24 (1977), pp. 332–337.CrossRefGoogle Scholar
[HoU] Hopcroft, J. E. and Ullman, J. D., Introduction to automata theory, languages, and computation, Addison-Wesley, Reading, Massachusetts, 1979.Google Scholar
[HuR1] Hunt, H. B. III, and Rosenkrantz, D.J., On equivalence and containment problems for formal languages, Journal of the Association for Computing Machinery, vol. 24 (1977), pp. 387–396.CrossRefGoogle Scholar
[HuR2] Hunt, H. B. III, and Rosenkrantz, D.J., Computational parallels between the regular and context-free languages, SIAM Journal on Computing, vol. 7 (1978), pp. 99–114.CrossRefGoogle Scholar
[HuRS] Hunt, H. B. III, Rosenkrantz, D. J., and Szymanski, T. G., On the equivalence, containment, and covering problems for the regular and context-free languages, Journal of Computer and System Sciences, vol. 12 (1976), pp. 222–268.CrossRefGoogle Scholar
[Huy] Huynh, D. T., Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is -complete, Theoretical Computer Science, vol. 33 (1984), pp. 305–326.CrossRefGoogle Scholar
[Ib] Ibarra, O. H., A note concerning nondeterministic tape complexities, Journal of the Association for Computing Machinery, vol. 19 (1972), pp. 608–612.CrossRefGoogle Scholar
[IbM] Ibarra, O. H. and Moran, S., Probabilistic algorithms for deciding equivalence of straight-line programs, Journal of the Association for Computing Machinery, vol. 30 (1983), pp. 217–228.CrossRefGoogle Scholar
[Im1] Immerman, N., Relational queries computable in polynomial time, Proceedings of the 14th ACM Symposium on Theory of Computing (1982), 147–152.Google Scholar
[Im2] Immerman, N., Languages which capture complexity classes, Proceedings of the 15th ACM Symposium on Theory of Computing (1983), 347–354.Google Scholar
[Je] Jeroslow, R. G., The polynomial hierarchy and a simple model for competitive analysis, Report No. 83272-OR, Institut für Ökonometrie und Operations Research, Rheinische Friedrich-Wilhelms-Universität, Bonn, 1983.Google Scholar
[Joh1] Johnson, D. S., The NP-completeness column: an ongoing guide, Journal of Algorithms, vol. 4 (1983), pp. 397–411.CrossRefGoogle Scholar
[Joh2] Johnson, D. S., The NP-completeness column: an ongoing guide, Journal of Algorithms, vol. 5 (1984), pp. 284–299.CrossRefGoogle Scholar
[Joh3] Johnson, D. S., The NP-completeness column: an ongoing guide, Journal of Algorithms, vol. 5 (1984), pp. 433–447.CrossRefGoogle Scholar
[Joh4] Johnson, D. S., The NP-completeness column: an ongoing guide, Journal of Algorithms, vol. 6 (1985), pp. 291–305.CrossRefGoogle Scholar
[Jon] Jones, N. D., Space-bounded reducibility among combinatorial problems, Journal of Computer and System Sciences, vol. 11 (1975), pp. 68–85.CrossRefGoogle Scholar
[JoL] Jones, N. D. and Laaser, W. T., Complete problems for deterministic polynomial time, Theoretical Computer Science, vol. 3 (1977), pp. 105–117.CrossRefGoogle Scholar
[JoLL] Jones, N. D., Lien, Y. E., and Laaser, W. T., New problems complete for nondeterministic log space, Mathematical Systems Theory, vol. 10 (1976), pp. 1–18.CrossRefGoogle Scholar
[JoS] Jones, N. D. and Selman, A. L., Turing machines and the spectra of first-order formulas, this Journal, vol. 39 (1974), pp. 139–150.Google Scholar
[Ka1] Karp, R. M., Reducibility among combinatorial problems, Complexity of computer computations (Miller, R. E. and Thatcher, J. W., editors), Plenum Press, New York, 1972, pp. 85–104.CrossRefGoogle Scholar
[Ka2] Karp, R. M., Combinatorics, complexity, and randomness, Communications of the ACM, vol. 29 (1986), pp. 98–109.CrossRefGoogle Scholar
[KaM] Karp, R. M. and Miller, R. E., Parallel program schemata, Journal of Computer and System Sciences, vol. 3 (1969), pp. 147–195.CrossRefGoogle Scholar
[Kh] Khachiyan, L. G., A polynomial algorithm for linear programming, Doklady Akademii Nauk SSSR, vol. 244 (1979), pp. 1093–1096 (in Russian); English translation, Soviet Mathematics Doklady , vol. 20(1979), pp. 191–194.Google Scholar
[Ko1] Kozen, D., Complexity of finitely presented algebras, Proceedings of the 9th ACM Symposium on Theory of Computing (1977), pp. 164–177.Google Scholar
[Ko2] Kozen, D., Complexity of Boolean algebras, Theoretical Computer Science, vol. 10 (1980), pp. 221–248.CrossRefGoogle Scholar
[Lad1] Ladner, R. E., On the structure of polynomial time reducibility, Journal of the Association for Computing Machinery, vol. 22 (1975), pp. 155–171.CrossRefGoogle Scholar
[Lad2] Ladner, R. E., The circuit value problem is log space complete for P, SIGACT News, vol. 7 (1975), no. 1, pp. 18–20.CrossRefGoogle Scholar
[Lad3] Ladner, R. E., The computational complexity of provability in systems of modal propositional logic, SIAM Journal on Computing, vol. 6 (1977), pp. 467–480.CrossRefGoogle Scholar
[LaLS] Ladner, R. E., Lynch, N. A., and Selman, A. L., A comparison of polynomial time reducibilities, Theoretical Computer Science, vol. 1 (1975), pp. 103–123.CrossRefGoogle Scholar
[LaN] Ladner, R. E. and Norman, J. K., Solitaire automata, Journal of Computer and System Sciences, vol. 30 (1985), pp. 116–129.CrossRefGoogle Scholar
[Lau] Lautemann, C., BPP and the polynomial hierarchy, Information Processing Letters, vol. 17 (1983), pp. 215–217.CrossRefGoogle Scholar
[Lev] Levin, L. A., Universal sorting problems, Problemy Peredachi Informatsii, vol. 9 (1973), no. 3, pp. 115–116 (in Russian); English translation, Problems of Information Transmission , vol. 9 (1973), pp. 265–266.Google Scholar
[Lew] Lewis, H. R., Complexity results for classes of quantificational formulas, Journal of Computer and System Sciences, vol. 21 (1980), pp. 317–353.CrossRefGoogle Scholar
[Liv] Livchak, A. B., The relational model for process control, Nauchno-Tekhnicheskaya Informatsiya, ser. 2, 1983, no. 4, pp. 27–29 (in Russian); English translation in Automatic Documentation and Mathematical Linguistics , vol. 17 (1983), pp. 105–110.Google Scholar
[Lo] Lo, L., On the computational complexity of the theory of abelian groups, Ph.D. Thesis, University of Michigan, Ann Arbor, Michigan, 1984.Google Scholar
[Ly] Lynch, N., On reducibility to complex or sparse sets, Journal of the Association for Computing Machinery, vol. 22 (1975), pp. 341–345.CrossRefGoogle Scholar
[Mah1] Mahaney, S. R., On the number of p-isomorphism classes of NP-complete sets, Proceedings of the 22nd IEEE Symposium on Foundations of Computer Science (1981), pp. 271–278.Google Scholar
[Mah2] Mahaney, S. R., Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis, Journal of Computer and System Sciences, vol. 25 (1982), pp. 130–143.CrossRefGoogle Scholar
[MaM1] Mayr, E. and Meyer, A. R., The complexity of the finite containment problem for Petri nets, Journal of the Association for Computing Machinery, vol. 28 (1981), pp. 561–576.CrossRefGoogle Scholar
[MaM2] Mayr, E. and Meyer, A. R., The complexity of the word problems for commutative semigroups and polynomial ideals, Advances in Mathematics, vol. 46 (1982), pp. 305–329.CrossRefGoogle Scholar
[Me1] Meyer, A. R., Weak monadic second-order theory of successor is not elementary-recursive, Logic colloquium: symposium on logic held at Boston 1972–73 (Parikh, R., editor), Lecture Notes in Mathematics, vol. 453, Springer-Verlag, New York, 1975, pp. 132–154.CrossRefGoogle Scholar
[Me2] Meyer, A. R., The inherent computational complexity of theories of ordered sets, Proceedings of the International Congress of Mathematicians (Vancouver, 1974), Vol. 2, Canadian Mathematical Congress, Montréal, 1975, pp. 477–482.Google Scholar
[MeS] Meyer, A. R. and Stockmeyer, L. J., The equivalence problem for regular expressions with squaring requires exponential space, Proceedings of the 13th IEEE Symposium on Switching and Automata Theory (1972), pp. 125–129.Google Scholar
[Mi] Miller, G. L., Riemann's hypothesis and tests for primality, Journal of Computer and System Sciences, vol. 13 (1976), pp. 300–317.CrossRefGoogle Scholar
[Mo] Monk, L., Elementary recursive decision procedures, Ph.D. Thesis, University of California, Berkeley, California, 1975.Google Scholar
[Mos] Moschovakis, Y. N., Elementary induction on abstract structures, North-Holland, Amsterdam, 1974.Google Scholar
[Pa1] Papadimitriou, C. H., On the complexity of unique solutions, Journal of the Association for Computing Machinery, vol. 31 (1984), pp. 392–400.CrossRefGoogle Scholar
[Pa2] Papadimitriou, C. H., Games against nature, Journal of Computer and System Sciences, vol. 31 (1985), pp. 288–301.CrossRefGoogle Scholar
[PaS] Papadimitriou, C. H. and Steiglitz, K., Combinatorial optimization: algorithms and complexity, Prentice-Hall, Englewood Cliffs, N.J., 1982.Google Scholar
[PaW] Papadimitriou, C. H. and Wolfe, D., The complexity of facets resolved, Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (1985), pp. 74–78.Google Scholar
[PaY] Papadimitriou, C. H. and Yannakakis, M., The complexity of facets (and some facets of complexity), Journal of Computer and System Sciences, vol. 28 (1984), pp. 244–259.CrossRefGoogle Scholar
[PPST] Paul, W. J., Pippenger, N., Szemerédi, E., and Trotter, W. T., On determinism versus nondeterminism and related problems, Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (1983), pp. 429–438.Google Scholar
[Pi] Pippenger, N., On simultaneous resource bounds, Proceedings of the 20th IEEE Symposium on Foundations of Computer Science (1979), pp. 307–311.Google Scholar
[PiF] Pippenger, N. and Fischer, M. J., Relations among complexity measures, Journal of the Association for Computing Machinery, vol. 26 (1979), pp. 361–381.CrossRefGoogle Scholar
[P1] Plaisted, D. A., Complete problems in the first-order predicate calculus, Journal of Computer and System Sciences, vol. 29 (1984), pp. 8–35.CrossRefGoogle Scholar
[Pn] Pnueli, A., The temporal logic of programs, Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (1977), pp. 46–57.Google Scholar
[Pr1] Pratt, V. R., Semantical considerations on Floyd-Hoare logic, Proceedings of the 17th IEEE Symposium on Foundations of Computer Science (1976), pp. 109–121.Google Scholar
[Pr2] Pratt, V. R., Models of program logics, Proceedings of the 20th IEEE Symposium on Foundations of Computer Science (1979), pp. 115–122.Google Scholar
[PrS] Pratt, V. R. and Stockmeyer, L. J., A characterization of the power of vector machines, Journal of Computer and System Sciences, vol. 12 (1976), pp. 198–221.CrossRefGoogle Scholar
[Rab1] Rabin, M. O., Degree of difficulty of computing a function and a partial ordering of recursive sets, Technical Report 2, Hebrew University, Jerusalem, 1960.Google Scholar
[Rab2] Rabin, M. O., A simple method for undecidability proofs and some applications, Proceedings of the 1964 international congress for logic, methodology and philosophy of science (Bar-Hillel, Y., editor), North-Holland, Amsterdam, 1965, pp. 58–68.Google Scholar
[Rab3] Rabin, M. O., Decidability of second-order theories and automata on infinite trees, Transactions of the American Mathematical Society, vol. 141 (1969), pp. 1–35.Google Scholar
[Rab4] Rabin, M. O., Theoretical impediments to artificial intelligence, Information Processing 74 (Rosenfeld, J., editor), North-Holland, Amsterdam, 1974, pp. 615–619.Google Scholar
[Rab5] Rabin, M. O., Probabilistic algorithm for testing primality, Journal of Number Theory, vol. 12 (1980), pp. 128–138.CrossRefGoogle Scholar
[Rab6] Rabin, M. O., Probabilistic algorithms in finite fields, SIAM Journal on Computing, vol. 9 (1980), pp. 273–280.CrossRefGoogle Scholar
[Rac1] Rackoff, C. W., The computational complexity of some logical theories, Doctoral Thesis, Department of Electrical Engineering, M.I.T., Cambridge, Massachusetts, 1974; also Report TR-144, M.I.T. Laboratory for Computer Science.Google Scholar
[Rac2] Rackoff, C. W., The complexity of theories of the monadic predicate calculus, Research Report # 136, IRIA-LABORIA, France, 10 1975.Google Scholar
[Rac3] Rackoff, C. W., On the complexity of the theories of weak direct powers, this Journal, vol. 41 (1976), pp. 561–573.Google Scholar
[Rac4] Rackoff, C. W., Relativized questions involving probabilistic algorithms, Journal of the Association for Computing Machinery, vol. 29 (1982), pp. 261–268.CrossRefGoogle Scholar
[ReL] Reddy, C. R. and Loveland, D. W., Presburger arithmetic with bounded quantifier alternation, Proceedings of the 10th ACM Symposium on Theory of Computing (1978), pp. 320–325.Google Scholar
[Reif] Reif, J., The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, vol. 29 (1984), pp. 274–301.CrossRefGoogle Scholar
[Reis] Reisch, S., Hex ist PSPACE-vollständig, Acta lnformatica, vol. 15 (1981), pp. 167–191.CrossRefGoogle Scholar
[Ro] Robertson, E. L., Structure of complexity in the weak monadic second-order theories of the natural numbers, Proceedings of the 6th ACM Symposium on Theory of Computing (1974), pp. 161–171.Google Scholar
[Rob1] Robson, J. M., N by N checkers is exptime complete, SIAM Journal on Computing, vol. 13 (1984), pp. 252–267.CrossRefGoogle Scholar
[Rob2] Robson, J. M., The complexity of go, Information Processing 83 (Proceedings of the ninth IFIP world computer congress, Paris, 1983; Mason, R. E. A., editor), North-Holland, Amsterdam, 1983, pp. 413–418.Google Scholar
[Rog] Rogers, H. Jr., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[Ruz] Ruzzo, W. L., On uniform circuit complexity, Journal of Computer and System Sciences, vol. 22 (1981), pp. 365–383.CrossRefGoogle Scholar
[SaY] Sagiv, Y. and Yannakakis, M., Equivalences among relational expressions with the union and difference operators, Journal of the Association for Computing Machinery, vol. 27 (1980), pp. 633–655.CrossRefGoogle Scholar
[Sav] Savitch, W. J., Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol. 4 (1970), pp. 177–192.CrossRefGoogle Scholar
[Scha] Schaefer, T. J., On the complexity of some two-person perfect-information games, Journal of Computer and System Sciences, vol. 16 (1978), pp. 185–225.CrossRefGoogle Scholar
[Sehn] Schnorr, C. P., The network complexity and the Turing machine complexity of finite functions, Acta Informatica, vol. 7 (1976), pp. 95–107.CrossRefGoogle Scholar
[Scho] Scholz, H., Ein ungelöstes Problem in der symbolischen Logik, this Journal, vol. 17 (1952), p. 160.Google Scholar
[Schw] Schwartz, J. T., Fast probabilistic algorithms for verification of polynomial identities, Journal of the Association for Computing Machinery, vol. 27 (1980), pp. 701–717.CrossRefGoogle Scholar
[Se] Seiferas, J. I., Relating refined space complexity classes, Journal of Computer and System Sciences, vol. 14 (1977), pp. 100–129.CrossRefGoogle Scholar
[SeFM] Seiferas, J. I., Fischer, M. J., and Meyer, A. R., Separating nondeterministic time complexity classes, Journal of the Association for Computing Machinery, vol. 25 (1978), pp. 146–167.CrossRefGoogle Scholar
[Sip1] Sipser, M., On relativization and the existence of complete sets, Automata, languages and programming (Aarhus, 1982), Lecture Notes in Computer Science, vol. 140, Springer-Verlag, New York, 1982, pp. 523–531.CrossRefGoogle Scholar
[Sip2] Sipser, M., Borel sets and circuit complexity, Proceedings of the 15th ACM Symposium on Theory of Computing (1983), pp. 61–69.Google Scholar
[Sip3] Sipser, M., A complexity theoretic approach to randomness, Proceedings of the 15th ACM Symposium on Theory of Computing (1983), pp. 330–335.Google Scholar
[SisC] Sistla, A. P. and Clarke, E. M., The complexity of propositional linear temporal logics, Journal of the Association for Computing Machinery, vol. 32 (1985), pp. 733–749.CrossRefGoogle Scholar
[SiVW] Sistla, A. P., Vardi, M. Y., and Wolper, P., The complementation problem for Büchi automata with applications to temporal logic, Proceedings of the 12th international colloquium on automata, languages and programming, Lecture Notes in Computer Science, vol. 194, Springer-Verlag, New York, 1985, pp. 465–474.CrossRefGoogle Scholar
[SoS] Solovay, R. and Strassen, V., A fast Monte-Carlo test for primality, SIAM Journal on Computing, vol. 6 (1977), pp. 84–85; erratum, vol. 7 (1978), p. 118.CrossRefGoogle Scholar
[StHL] Stearns, R. E., Hartmanis, J., and Lewis, P. M. II, Hierarchies of memory limited computations, Proceedings of the 6th IEEE Symposium on Switching Circuit Theory and Logical Design (1965), pp. 179–190.Google Scholar
[Sto1] Stockmeyer, L. J., The complexity of decision problems in automata theory and logic, Doctoral Thesis, Department of Electrical Engineering, M.I.T., Cambridge, Massachusetts, 1974; also Report TR-133, M.I.T. Laboratory for Computer Science.Google Scholar
[Sto2] Stockmeyer, L. J., The polynomial-time hierarchy, Theoretical Computer Science, vol. 3 (1977), pp. 1–22.CrossRefGoogle Scholar
[StoC] Stockmeyer, L. J. and Chandra, A. K., Provably difficult combinatorial games, SIAM Journal on Computing, vol. 8 (1979), pp. 151–174.CrossRefGoogle Scholar
[StoM] Stockmeyer, L. J. and Meyer, A. R., Word problems requiring exponential time: preliminary report, Proceedings of the 5th ACM Symposium on Theory of Computing (1973), pp. 1–9.Google Scholar
[Sud] Sudborough, I. H., A note on tape-bounded complexity classes and linear context-free languages, Journal of the Association for Computing Machinery, vol. 22 (1975), pp. 499–500.CrossRefGoogle Scholar
[Tarj] Tarjan, R. E., Data structures and network algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, no. 44, Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1983.CrossRefGoogle Scholar
[Tars] Tarski, A., A decision method for elementary algebra and geometry, 2nd ed., University of California Press, Berkeley, California, 1951.CrossRefGoogle Scholar
[Va1] Valiant, L. G., The complexity of computing the permanent, Theoretical Computer Science, vol. 8 (1979), pp. 189–202.CrossRefGoogle Scholar
[Va2] Valiant, L. G., The complexity of enumeration and reliability problems, SIAM Journal on Computing, vol. 8 (1979), pp. 410–421.CrossRefGoogle Scholar
[VaV] Valiant, L. G. and Vazirani, V. V., NP is as easy as detecting unique solutions, Proceedings of the 17th ACM Symposium on Theory of Computing (1985), pp. 458–463.Google Scholar
[Var] Vardi, M. Y., The complexity of relational query languages, Proceedings of the 14th ACM Symposium on Theory of Computing (1982), pp. 137–146.Google Scholar
[VarS] Vardi, M. Y. and Stockmeyer, L., Improved upper and lower bounds for modal logics of programs: preliminary report, Proceedings of the 17th ACM Symposium on Theory of Computing (1985), pp. 240–251.Google Scholar
[Wr] Wrathall, C., Complete sets and the polynomial-time hierarchy, Theoretical Computer Science, vol. 3 (1977), pp. 23–33.CrossRefGoogle Scholar
[Ya] Yao, A. C., Separating the polynomial-time hierarchy by oracles, Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (1985), pp. 1–10.Google Scholar