Author:
Zubkov M. V.,Kalimullin I. Sh.,Melnikov A. G.,Frolov A. N.
Reference25 articles.
1. Kalimullin I., Melnikov A., and Ng K. M., “Algebraic structures computable without delay,” Theoret. Comput. Sci., vol. 674, 73–98 (2017).
2. Kalimullin I. S., Melnikov A. G., and Ng K. M., “The diversity of categoricity without delay,” Algebra and Logic, vol. 56, no. 2, 171–177 (2017).
3. Bazhenov N., Harrison-Trainor M., Kalimullin I., Melnikov A., and Ng K. M., “Automatic and polynomial-time algebraic structures,” J. Symb. Log., 1–32 (2019).
4. Downey R., Harrison-Trainor M., Kalimullin I., Melnikov A., and Turetsky D., “Graphs are not universal for online computablility,” 1–14 (2018). http://homepages.ecs.vuw.ac.nz/harrism1/papers/punctual-graphs.pdf. Victoria Univ. Wellington.
5. Cenzer D. and Remmel J., “Feasibly categorical abelian groups,” in: Feasible Mathematics. II (Ithaca, NY, 1992); Vol. 13 of Progr. Comput. Sci. Appl. Logic, Birkhäuser Boston, Boston, 1995, 91–153.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Punctual 1-Linear Orders;Lobachevskii Journal of Mathematics;2023-07