|
This article is cited in 7 scientific papers (total in 7 papers)
Communications
Polynomially computable structures with finitely many generators
P. E. Alaevab a Novosibirsk State University
b Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Received: 24.07.2020 Revised: 21.10.2020
Citation:
P. E. Alaev, “Polynomially computable structures with finitely many generators”, Algebra Logika, 59:3 (2020), 385–394; Algebra and Logic, 59:3 (2020), 266–272
Linking options:
https://www.mathnet.ru/eng/al2621 https://www.mathnet.ru/eng/al/v59/i3/p385
|
|