Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Sachkov V. N., Vvedenie v kombinatornye metody diskretnoi matematiki, Nauka, M., 1982, 384 pp.
[2] B. A. Pogorelov, V. N. Sachkov (red.), Slovar kriptograficheskikh terminov, MTsNMO, M., 2006, 94 pp.
[3] Kharari F., Teoriya grafov, Mir, M., 1973, 302 pp.
[4] Smirnov V. G., “Effektivnye algoritmy postroeniya grafa obschego resheniya dlya sistem bulevykh uravnenii”, Trudy po diskretnoi matematike, 5 (2002), 227–234
[5] Smirnov V. G., “Algoritmy resheniya sistem $k$-znachnykh uravnenii, ispolzuyuschie postroenie orgrafa reshenii”, Trudy po diskretnoi matematike, 6 (2002), 194–212
[6] Smirnov V. G., “Metody postroeniya grafov reshenii dlya sistem $k$-znachnykh uravnenii”, Trudy po diskretnoi matematike, 8 (2004), 253–280
[7] Smirnov V. G., “Metody resheniya sistem diskretnykh uravnenii, osnovannye na postroenii grafa reshenii”, Trudy po diskretnoi matematike, 9 (2006), 308–339
[8] Smirnov V. G., “Metody resheniya sistem kvazisimmetrichnykh uravnenii i ikh primenenie k analizu generatorov s upravlyaemym dvizheniem”, Matematicheskie voprosy kriptografii, 1:3 (2010), 67–92 | DOI
[9] Smirnov V. G., “Diskretnye funktsii i razrezhennye sistemy diskretnykh uravnenii”, Matematicheskie voprosy kriptografii, 7:3 (2016), 93–114 | DOI | Zbl