Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference7 articles.
1. Aanderaa, S.: A proof of Higman's embedding theorem, using Britton extension of groups. In: Word problems (W.W. Boone, F.B. Cannonito, R. Lyndon, eds.), pp. 1?17. Amsterdam-London: North Holland 1975
2. Avenhaus, J., Madlener, K.: Subrekursive Komplexität bei Gruppen. I. Gruppen mit vorgeschriebener Komplexität. Acta Informat. 9, 87?104 (1977)
3. Gatterdam, R.W.: The computability of group constructions II. Bull. Austral. Math. Soc. 8, 27?60 (1973)
4. Higman, G.: Subgroups of finitely presented groups. Proc. Roy. Soc. London Ser. A 262, 455?475 (1961)
5. Machtey, M.: On the density of honest subrecursive classes. J. Comput. System Sci. 10, 183?199 (1975)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献