1. Lecture Notes in Computer Science;G Asser,1987
2. Bellantoni, S.J., Cook, S.A.: A new recursion-theoretic characterization of the polytime functions. Comput. Complex. 2, 97–110 (1992). https://doi.org/10.1007/BF01201998
3. Calude, C., Sântean, L.: On a theorem of günter asser. Math. Log. Q. 36(2), 143–147 (1990)
4. Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Studies in Logic and the Foundations of Mathematics. In: Proceedings of the 1964 International Congress, North-Holland, pp. 24–30 (1965)
5. Cook, S.A., Kapron, B.M.: A survey of classes of primitive recursive functions. Electron. Colloquium Comput. Complex. 1 (2017). https://eccc.weizmann.ac.il/report/2017/001