|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
A. Yu. Nikitin, N. D. Kudyk, “Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets”, Prikl. Diskr. Mat., 2024, no. 64, 7–19  |
|
2019 |
| 2. |
A. Yu. Nikitin, “Decidability of the restricted theories of a class of partial orders”, Prikl. Diskr. Mat., 2019, no. 45, 6–12 |
|
2018 |
| 3. |
A. Y. Nikitin, A. N. Rybalov, “On complexity of the satisfiability problem of systems over finite posets”, Prikl. Diskr. Mat., 2018, no. 39, 94–98  |
5
|
|
| Organisations |
|
|
Contact us: