I. Zeitlich beschränkte Turingmaschinen und polynomiale Reduktion

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


  1. Cobham, A., The intrinsic computational difficulty of functions, Logic, Methodology and Philosophy of Science (Bar-Hillel, ed.), Amsterdam, 1965.Google Scholar
  2. Edmonds, J., Paths, trees, and flowers, Canadian Journal of Math. 17 (1965) 449–467.Google Scholar
  3. Hermes, H., Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Springer, 1961.Google Scholar
  4. Hopcroft, J.E. and Ullman, J.D., Formal languages and their relation to automata, Addison-Wesley, Reading, Massachusetts, 1969.Google Scholar
  5. Turing, A.M., On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc. 2/42 (1937) 230–265.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Walter Baur

There are no affiliations available

Personalised recommendations