6 citations to https://www.mathnet.ru/eng/pdm685
  1. A. N. Rybalov, “O genericheskoi slozhnosti problemy klasterizatsii grafov s ogranicheniyami na razmer klasterov”, PDM, 2023, no. 60, 114–119  mathnet  crossref
  2. A. N. Rybalov, “O genericheskoi slozhnosti ogranichennoi problemy klasterizatsii grafov”, PDM, 2022, no. 57, 91–97  mathnet  crossref
  3. A. N. Rybalov, “O genericheskoi slozhnosti problemy razbieniya grafa na treugolniki”, PDM, 2022, no. 58, 105–111  mathnet  crossref
  4. Alexander Rybalov, “On generic complexity of the problem of searching of isomorphism for finite semigroups”, J. Phys.: Conf. Ser., 1901:1 (2021), 012045  crossref
  5. Alexander Rybalov, “On generic complexity of theories of finite algebraic structures”, J. Phys.: Conf. Ser., 1901:1 (2021), 012046  crossref
  6. Alexander Rybalov, Artem Shevlyakov, “Generic complexity of solving of equations in finite groups, semigroups and fields”, J. Phys.: Conf. Ser., 1901:1 (2021), 012047  crossref