Skip to main content
SpringerLink
Log in

Berechnung und Programm. II

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In §6 we define an algebraic equivalent of the notion of computation, in §§7, 8 we show that for a large class of computational problems no speed-up may be obtained by the use of branching, except for a small set of inputs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literatur

  1. Cohn, P.M.: Universal algebra. New York: Harper & Row 1965.

    Google Scholar 

  2. Cook, St.A., Reckhow, R. A.: Time-bounded random access machines. Conference Record. Fourth Annual ACM Symposium on Theory of Computing. Denver, Col., May 1, 2, 3, 1972. Session 2: pp. 73–80.

  3. Elgot, C.C., Robinson, A.: Random-access stored-program machines, an approach to programming languages. Journal ACM11, 365–399 (1964).

    Google Scholar 

  4. Engeler, E.: Formal languages. Chicago: Markham Publ. Co. 1968.

    Google Scholar 

  5. Engeler, E.: Introduction to the theory of computation. Part 2: Recursive functions. Lecture Notes 1970/71. Minneapolis: School of Mathematics, University of Minnesota.

  6. Hartmanis, J.: Computational complexity of random access stored program machines. Mathematical Systems Theory5, 232–245 (1971).

    Google Scholar 

  7. Kerkhoff, R.: Gleichungsdefinierbare Klassen partieller Algebren. Math. Ann.185, 112–133 (1970).

    Google Scholar 

  8. Kultze, R.: Garbentheorie. Stuttgart: Teubner 1970.

    Google Scholar 

  9. Mumford, D.: Introduction to algebraic geometry. Harvard Lecture Notes. 1966.

  10. Neumann, B.H.: Special topics in algebra: Universal algebra. Lectures delivered in the Fall Semester 1961/62. New York: Courant Inst. of Math. Sci. 1962.

    Google Scholar 

  11. Shafarevich, I. R.: Foundations of algebraic geometry. Russian Math. Surveys24, 1–178 (1969).

    Google Scholar 

  12. Slominski, J.: A theory ofP-homomorphisms. Coll. Math.14, 135–162 (1966).

    Google Scholar 

  13. Strassen, V.: Berechnung und Programm I. Acta Informatica1, 320–335 (1972).

    Google Scholar 

  14. Strassen, V.: Berechnungen in partiellen Algebren endlichen Typs. Erscheint in Computing 1973.

Download references

Author information

Authors and Affiliations

  1. Seminar für Angewandte Mathematik der Universität Zürich, Freiestr. 36, CH-8032, Zürich, Schweiz

    Volker Strassen

Authors
  1. Volker Strassen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Strassen, V. Berechnung und Programm. II. Acta Informatica 2, 64–79 (1973). https://doi.org/10.1007/BF00571464

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00571464

Search

Navigation