VIII. Untere Schranken für die Komplexität log. Entscheidungsprobleme

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


  1. Chandrasekharan, K., Analytic Number Theory. Springer Verlag, 1968.Google Scholar
  2. Fischer, M.J. und Rabin, M.O., Super-Exponential Complexity of Presburger Arithmetic, MAC Technical Memorandum 43, M.I.T., 1974.Google Scholar
  3. Meyer, A.R. und 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Joos Heintz

There are no affiliations available

Personalised recommendations