Polynomially Computable Structures with Finitely Many Generators › Research Explorer

Novosibirsk State University's Research Portal

Polynomially Computable Structures with Finitely Many Generators

Research output: Contribution to journal › Article › peer-review

Section of Algebra and Mathematical Logic

DOI

https://doi.org/10.1007/s10469-020-09598-5
Final published version

P. E. Alaev

Original language	English
Pages (from-to)	266-272
Number of pages	7
Journal	Algebra and Logic
Volume	59
Issue number	3
DOIs	https://doi.org/10.1007/s10469-020-09598-5
Publication status	Published - Jul 2020

OECD FOS+WOS

ID: 25852002