×

Berechnung und Programm. II. (German) Zbl 0258.68022


MSC:

68N01 General topics in the theory of software
68Q25 Analysis of algorithms and problem complexity
Full Text: DOI

References:

[1] Cohn, P.M.: Universal algebra. New York: Harper & Row 1965. · Zbl 0141.01002
[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. · Zbl 0357.68055
[3] Elgot, C.C., Robinson, A.: Random-access stored-program machines, an approach to programming languages. Journal ACM11, 365-399 (1964). · Zbl 0192.07302 · doi:10.1145/321239.321240
[4] Engeler, E.: Formal languages. Chicago: Markham Publ. Co. 1968. · Zbl 0157.01801
[5] Engeler, E.: Introduction to the theory of computation. Part 2: Recursive functions. Lecture Notes 1970/71. Minneapolis: School of Mathematics, University of Minnesota. · Zbl 0205.30601
[6] Hartmanis, J.: Computational complexity of random access stored program machines. Mathematical Systems Theory5, 232-245 (1971). · Zbl 0222.68020 · doi:10.1007/BF01694180
[7] Kerkhoff, R.: Gleichungsdefinierbare Klassen partieller Algebren. Math. Ann.185, 112-133 (1970). · doi:10.1007/BF01359700
[8] Kultze, R.: Garbentheorie. Stuttgart: Teubner 1970. · Zbl 0213.24601
[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.
[11] Shafarevich, I. R.: Foundations of algebraic geometry. Russian Math. Surveys24, 1-178 (1969). · Zbl 0204.21301 · doi:10.1070/RM1969v024n06ABEH001361
[12] Slominski, J.: A theory ofP-homomorphisms. Coll. Math.14, 135-162 (1966).
[13] Strassen, V.: Berechnung und Programm I. Acta Informatica1, 320-335 (1972). · Zbl 0252.68018 · doi:10.1007/BF00289512
[14] Strassen, V.: Berechnungen in partiellen Algebren endlichen Typs. Erscheint in Computing 1973. · Zbl 0265.68030
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.