Sciact
  • EN
  • RU

Polynomially Computable Structures with Finitely Many Generators Full article

Journal Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302
Output data Year: 2020, Volume: 59, Number: 3, Pages: 266-272 Pages count : 7 DOI: 10.1007/s10469-020-09598-5
Authors Alaev P.E. 1,2
Affiliations
1 Sobolev Institute of Mathematics, Novosibirsk, Russian Federation
2 Novosibirsk State University, Novosibirsk, Russian Federation

Abstract: [No abstract available]
Cite: Alaev P.E.
Polynomially Computable Structures with Finitely Many Generators
Algebra and Logic. 2020. V.59. N3. P.266-272. DOI: 10.1007/s10469-020-09598-5 WOS Scopus OpenAlex
Original: Алаев П.Е.
Полиномиально вычислимые структуры с конечным числом порождающих
Алгебра и логика. 2020. Т.59. №3. С.385-394. DOI: 10.33048/alglog.2020.59.307 OpenAlex
Identifiers:
Web of science: WOS:000584640500001
Scopus: 2-s2.0-85094165480
OpenAlex: W3097707318
Citing:
DB Citing
Scopus 6
OpenAlex 5
Web of science 6
Altmetrics: