51 citations to https://www.mathnet.ru/eng/rm267
  1. V. A. Roman'kov, “Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank”, Izv. Math., 87:4 (2023), 798–816  mathnet  crossref  crossref  mathscinet  adsnasa  isi
  2. A. N. Rybalov, “Generic Complexity of the Word Problem in Some Semigroups”, Algebra Logic, 61:6 (2023), 524  crossref
  3. M. Rybakov, “Computational complexity of the word problem in modal and pseudo-Boolean algebras with a small number of generators”, Russian Math. (Iz. VUZ), 66:5 (2022), 33–48  mathnet  crossref  crossref  mathscinet
  4. V. A. Roman'kov, “Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two”, Sib. elektron. matem. izv., 19:1 (2022), 387–403  mathnet  crossref  mathscinet
  5. I. V. Dobrynina, “O podgruppakh v gruppakh Artina s drevesnoi strukturoi”, Chebyshevskii sb., 23:3 (2022), 118–132  mathnet  crossref
  6. A. N. Rybalov, “O genericheskoi slozhnosti problemy ravenstva v nekotorykh polugruppakh”, Algebra i logika, 61:6 (2022), 766–783  mathnet  crossref
  7. Zbigniew Lipiński, Jolanta Mizera-Pietraszko, Lecture Notes in Computer Science, 13758, Intelligent Information and Database Systems, 2022, 643  crossref
  8. V. A. Roman'kov, “Algorithmic theory of solvable groups”, PDM, 2021, no. 52, 16–64  mathnet  crossref  elib
  9. M. N. Rybakov, “Slozhnost problemy ravenstva slov v mnogoobraziyakh modalnykh algebr”, Vestnik TvGU. Seriya: Prikladnaya matematika, 2021, no. 3, 5–17  mathnet  crossref  elib
  10. Nyberg-Brodda C.-F., “The Word Problem For One-Relation Monoids: a Survey”, Semigr. Forum, 103:2 (2021), 297–355  crossref  isi
1
2
3
4
5
6
Next