Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. D. Cenzer and J. Remmel, “Polynomial-time versus recursive models,” Ann. Pure Appl. Log., 54, No. 1, 17-58 (1991).
2. D. Cenzer and J. B. Remmel, “Complexity theoretic model theory and algebra,” in Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (Eds.), Stud. Log. Found. Math., 138, Elsevier, Amsterdam (1998), pp. 381-513.
3. P. E. Alaev, “Structures computable in polynomial time. I,” Algebra and Logic, 55, No. 6, 421-435 (2016).
4. P. E. Alaev and V. L. Selivanov, “Fields of algebraic numbers computable in polynomial time. I,” Algebra and Logic, 58, No. 6, 447-469 (2019).
5. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA (1974).
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献