Malinina, N. L. (2022). Necessary and sufficient conditions for dividing the structure of algorithms into non-intersecting sets: Polynomial and enumeration algorithms. Vestnik Rossiĭskogo universiteta druzhby narodov. Serii͡a︡ Inzhenernye issledovanii͡a, 23(2), 108-116. https://doi.org/10.22363/2312-8143-2022-23-2-108-116
Citace podle Chicago (17th ed.)Malinina, Natalia L. "Necessary and Sufficient Conditions for Dividing the Structure of Algorithms into Non-intersecting Sets: Polynomial and Enumeration Algorithms." Vestnik Rossiĭskogo Universiteta Druzhby Narodov. Serii͡a︡ Inzhenernye Issledovanii͡a 23, no. 2 (2022): 108-116. https://doi.org/10.22363/2312-8143-2022-23-2-108-116.
Citace podle MLA (9th ed.)Malinina, Natalia L. "Necessary and Sufficient Conditions for Dividing the Structure of Algorithms into Non-intersecting Sets: Polynomial and Enumeration Algorithms." Vestnik Rossiĭskogo Universiteta Druzhby Narodov. Serii͡a︡ Inzhenernye Issledovanii͡a, vol. 23, no. 2, 2022, pp. 108-116, https://doi.org/10.22363/2312-8143-2022-23-2-108-116.