Reference26 articles.
1. 1.AUSIELLO G., Abstract Computational Complexity and Cycling Computations, J.C.S.S., vol. 5, 1971, p. 118-128.2816180225.02025
2. 2.AUSIELLO G., Computational Complexity. Main Results and a Commentary, Seminaire I.R.I.A., 1972.
3. 3.AUSIELLO G., Complessita di Calcolo delleFunzioni. Boringhieri, Ed., 1975.
4. 4.BATINI C. et PETTOROSSI A., On Subrecursiveness in Weak Combinatory Logic, in λ Calculus and Computer Science Theory, Proceedings of the Symposium held in Rome, C. Bohm, Ed., Springer Verlag, 1975, p. 288-297.4799870332.02033
5. 5.BLUM M., A Machine Independent Theory of the Complexity of Recursive Functions, J.A.C.M., vol. 14, n° 2, 1967, p. 322-336.2359120155.01503
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献