Part of the Lecture Notes in Computer Science book series (LNCS, volume 43)


  1. Collins, G.E., Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Lecture Notes in Computer Science No. 33 (1975) 134–183, Springer-Verlag.Google Scholar
  2. Cook, S.A., The complexity of theorem proving procedures, Conf. Rec. of 3rd ACM Symp. on Theory of Computing (1970) 151–158.Google Scholar
  3. Fischer, M.J. und Pippenger, N.J., in Vorbereitung.Google Scholar
  4. Fischer, M.J. and Rabin, M.D., Super-exponential complexity of Presburger arithmetic, MAC Technical Memorandum 43, M.I.T., 1974.Google Scholar
  5. Hall, M. Jr., An algorithm for distinct representatives, Amer. Math. Monthly 63 (1956) 716–717.Google Scholar
  6. Hodes, L. and Specker, E., Length of formulas and elimination of quantifiers I, Contr. to Math. Logic (1968) 175–188.Google Scholar
  7. Hopcroft, J.E. and Ullman, J.D., Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Massachusetts, 1969.Google Scholar
  8. Jones, N.D. and Selman, A.L., Turing machines and the spectre of first-order formulas, J. Symbolic Logic 39 (1974) 139–150.Google Scholar
  9. Karp, R.M., Reducibility among combinatorial problems, IBM Symposium 1972: Complexity of Computer Computations, Plenum Press, New York, 1972.Google Scholar
  10. Knuth, D.E., The Art of Computer Programming, vol. 2, Addison-Wesley, Reading, Massachusetts, 1969.Google Scholar
  11. Meyer, A.R. and Stockmeyer, J.L., The equivalence problem for regular expressions with squaring requires exponential space, Conf. Rec. of 13th Annual Symp. on Switching and Automata Theory (1972) 125–129.Google Scholar
  12. Meyer, A.R. and Stockmeyer, L.J., Inherent computational complexity of decision problems in logic and automata theory, erscheint in Lecture Notes in Computer Science, Springer-Verlag.Google Scholar
  13. Nečiporuk, È.I., A boolean function, Dokl. Akad. Nauk SSSR 169 (1966) 765–766, Engl. Transl.: Soviet Math. Dokl. 7 (1966) 999–1000.Google Scholar
  14. Scholz, H., Ein ungelöstes Problem in der symbolischen Logik, J. Symbolic Logic 17 (1952) 160.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Personalised recommendations