Sholomov L. A. «On an invariant for the problem of underdetermined data decomposing» // Applied Discrete Mathematics 2018. №39 C.13-32
Semenov A. A. «ABOUT TSEITIN TRANSFORMATION IN LOGICAL EQUATIONS » // 2009. №4(6) C.28-50
Magomedov T. A., Magomedov A. M. «Regular edge 5-coloring of bipatite graph that is an interval on one part» // 2011. №3(13) C.85-91
Rybalov A. N., Nikitin A. Y. «On complexity of the satisfiability problem of systems over finite posets» // Applied Discrete Mathematics 2018. №39 C.94-98
Murin D. M. «About some features of the transformed problems images» // 2012. №3(17) C.96-102
Rybalov A. N. «On generic NP-completeness of the problem of Boolean circuits satisfiability» // Applied Discrete Mathematics 2020. №47 C.101-107
Kalinnikov I. S. «Computational complexity of the synthesis of composite models for Lipschitz-bounded functions» // Applied Discrete Mathematics 2014. №3 (25) C.103-110
Rybalov A. N. «On generic NP-completeness of the Boolean satisfiability problem» // Applied Discrete Mathematics 2017. №36 C.106-112
Rybalov Alexandr N., Lopatin Artem A. «On generic complexity of equation solving over the bicyclic monoid» // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 2025. №67 C.110-117