Author:
Kalimullin I. S.,Melnikov A. G.,Ng K. M.
Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. I. Kalimullin, A. Melnikov, and K. M. Ng, “Algebraic structures computable without delay,” Theor. Comput. Sci., 674, 73-98 (2017).
2. D. Cenzer and J. Remmel, “Polynomial-time versus recursive models,” Ann. Pure Appl. Log., 54, No. 1, 17-58 (1991).
3. D. Cenzer, R. G. Downey, J. B. Remmel, and Z. Uddin, “Space complexity of Abelian groups,” Arch. Math. Log., 48, No. 1, 115-140 (2009).
4. C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., 144, Elsevier, Amsterdam (2000).
5. S. S. Goncharov and Yu. L. Ershov, Constructive Models, Siberian School of Algebra and Logic [in Russian] Nauch. Kniga, Novosibirsk (1999).
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献